×

zbMATH — the first resource for mathematics

Intersection graphs of paths in a tree. (English) Zbl 0595.05062
See the preview in Zbl 0572.05049.

MSC:
05C99 Graph theory
05C05 Trees
68R10 Graph theory (including graph drawing) in computer science
05C38 Paths and cycles
05A05 Permutations, words, matrices
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Berge, C, Some classes of perfect graphs, () · Zbl 0203.26403
[2] Berge, C, ()
[3] Buneman, P, A characterization of rigid circuit graphs, Discrete math., 9, 205-212, (1974) · Zbl 0288.05128
[4] Fujishige, S, An efficient PQ-graph algorithm for solving the graph-realization problem, J. comput. system sci., 21, 63-86, (1980) · Zbl 0438.68028
[5] Fulkerson, D.R; Gross, O.A, Incidence matrices with consecutive ones property, Bull. amer. math. soc., 70, 681-684, (1964) · Zbl 0126.39501
[6] Garey, M.R; Johnson, D.J, ()
[7] Gavril, F, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, SIAM J. comput., 1, 180-187, (1972) · Zbl 0227.05116
[8] Gavril, F, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. combin. theory ser. B, 16, 47-56, (1974) · Zbl 0266.05101
[9] Gavril, F, A recognition algorithm for the intersection graphs of directed paths in directed trees, Discrete math., 13, 237-249, (1975) · Zbl 0312.05108
[10] Gavril, F, A recognition algorithm for the intersection graphs of paths in trees, Discrete math., 23, 211-227, (1978) · Zbl 0398.05060
[11] Gavril, F; Tamari, R, An algorithm for constructing edge-trees from hypergraphs, Networks, 3, 377-388, (1983) · Zbl 0521.05049
[12] Gavril, F; Tamari, R, An algorithm for constructing trees from hypergraphs, (), published in the series · Zbl 0521.05049
[13] Gilmore, P.C; Hoffman, A.J, A characterization of comparability graphs and of interval graphs, Canad. J. math., 16, 539-548, (1964) · Zbl 0121.26003
[14] Golumbic, M.C, ()
[15] Golumbic, M.C; Jamison, R.E, The edge intersection graphs of paths in a tree, J. combin. theory, 55, 151-159, (1985) · Zbl 0568.05023
[16] \scM. C. Golumbic and R. E. Jamison, Edge and vertex intersection of paths in a tree, Discrete Math., in press. · Zbl 0568.05023
[17] Klee, V, What are the intersection graphs of arcs in a circle?, Amer. math. monthly, 76, 810-813, (1969)
[18] Köning, D, Theorie des endlichen und unendlichen graphen, (1936), Akademische Leipzig
[19] \scW. A. Lobb. Perfect graphs from paths in trees, unpublished manuscript. · Zbl 1200.57011
[20] Renz, P.L, Intersection representations of graphs by arcs, Pacific J. math., 34, 501-510, (1970) · Zbl 0191.55103
[21] \scF. S. Roberts, “Discrete Mathematical Models with Applications to Social, Biological and Environmental Problems,” Prentice-Hall, Englewood Cliffs, N.J. · Zbl 0363.90002
[22] Syslo, M.M, On characterizations of cycle graphs, (), 395-398, Paris
[23] Syslo, M.M, (), Report Nr. N-40
[24] \scM. M. Syslo, Triangulated edge intersection graphs of paths in a tree, Discrete Math., in press. · Zbl 0569.05045
[25] Tarjan, R, Decomposition by clique separators, Discrete math., 55, 221-231, (1985) · Zbl 0572.05039
[26] Trotter, L.E, Line perfect graphs, Math. programming, 12, 255-259, (1977) · Zbl 0366.05043
[27] Tsukiyama, S; Ide, M; Ariyoshi, M; Shirawaka, I, A new algorithm for generating all the maximal independent sets, SIAM J. comput., 6, 505-517, (1977) · Zbl 0364.05027
[28] Tucker, A.C, Matrix characterizations of circular arc graphs, Pacific J. math., 39, 535-545, (1971) · Zbl 0226.05125
[29] Whitesides, S.H, An algorithm for finding clique cut-sets, Inform. process. lett., 12, 31-32, (1981) · Zbl 0454.68078
[30] Dietz, P.F, Intersection graph algorithms, ()
[31] Lehot, P.G.H, An optimal algorithm to detect a line graph and output its root graph, J. assoc. comput. Mach., 21, 569-575, (1974) · Zbl 0295.05118
[32] Holyer, I, The NP-completeness of edge-coloring, SIAM J. comput., 10, 718-720, (1981) · Zbl 0473.68034
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.