The intersection graphs of subtrees in trees are exactly the chordal graphs
- 1 February 1974
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 16 (1) , 47-56
- https://doi.org/10.1016/0095-8956(74)90094-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Intersection representations of graphs by arcsPacific Journal of Mathematics, 1970
- What Are the Intersection Graphs of Arcs in a Circle?The American Mathematical Monthly, 1969
- Incidence matrices, interval graphs and seriation in archeologyPacific Journal of Mathematics, 1969
- Circular genetic mapsJournal of Cellular Physiology, 1967
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961