Intersection graphs of paths in a tree
- 1 October 1986
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 41 (2) , 141-181
- https://doi.org/10.1016/0095-8956(86)90042-0
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Edge and vertex intersection of paths in a treeDiscrete Mathematics, 1985
- An algorithm for constructing edge‐trees from hypergraphsNetworks, 1983
- An efficient PQ-graph algorithm for solving the graph-realization problemJournal of Computer and System Sciences, 1980
- A recognition algorithm for the intersection graphs of paths in treesDiscrete Mathematics, 1978
- A recognition algorithm for the intersection graphs of directed paths in directed treesDiscrete Mathematics, 1975
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Incidence matrices with the consecutive 1’s propertyBulletin of the American Mathematical Society, 1964