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 |
Citations:
Zbl 0572.05049References:
| [1] | Berge, C., Some classes of perfect graphs, (Harary, F., Graph Theory and Theoretical Physics (1967), Academic Press: Academic Press New York) · Zbl 0203.26403 |
| [2] | Berge, C., (Graphs and Hypergraphs (1973), North-Holland: North-Holland New York) · Zbl 0483.05029 |
| [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., (Computers and Intractability: A Guide to the Theory of NP-completeness (1978), Freeman: Freeman San Francisco) |
| [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, (Proceedings, Fourth Symposium uber Operations Research. Proceedings, Fourth Symposium uber Operations Research, Saarbrucken. Proceedings, Fourth Symposium uber Operations Research. Proceedings, Fourth Symposium uber Operations Research, Saarbrucken, Operations Research Verfahren (1979)), 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., (Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press: Academic Press New York) · Zbl 0541.05054 |
| [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] | M. C. Golumbic and R. E. JamisonDiscrete Math.; M. C. Golumbic and R. E. JamisonDiscrete Math. · 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: Akademische Leipzig · Zbl 0013.22803 |
| [19] | W. A. Lobb; W. A. Lobb · Zbl 1200.57011 |
| [20] | Renz, P. L., Intersection representations of graphs by arcs, Pacific J. Math., 34, 501-510 (1970) · Zbl 0191.55103 |
| [21] | F. S. Roberts; F. S. Roberts · Zbl 0363.90002 |
| [22] | Syslo, M. M., On characterizations of cycle graphs, (Orsay 1976. Orsay 1976, Coloq. CNRS, Problems Combinatories et Theorie des Graphs (1978)), 395-398, Paris · Zbl 0412.05057 |
| [23] | Syslo, M. M., (On Characterizations of Cycle Graphs and on Other Families of Intersection Graphs (June 1978), Institute of Computer Science, University of Wroclaw: Institute of Computer Science, University of Wroclaw Poland), Report Nr. N-40 · Zbl 0412.05057 |
| [24] | M. M. SysloDiscrete Math.; M. M. SysloDiscrete Math. · 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, (Ph.D. thesis (August 1984), Cornell University) |
| [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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
