Subject
Discrete Mathematics and Combinatorics
Reference9 articles.
1. A characterization of rigid circuit graphs;Buneman;Discrete Math.,1974
2. On rigid circuit graphs;Dirac;Abh. Math. Sem. Univ. Hamburg,1961
3. The intersection graphs of subtrees in trees are exactly the chordal graphs;Gavril;J. Combin. Theory B,1974
4. Algorithmic Graph Theory and Perfect Graphs;Golumbic,1980
5. A Helly type problem in trees;Gyárfas,1970
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mutually embeddable graphs and the tree alternative conjecture;Journal of Combinatorial Theory, Series B;2006-11
2. Strongly perfect infinite graphs;Israel Journal of Mathematics;1995-10
3. Simplicial tree-decompositions of infinite graphs, I;Journal of Combinatorial Theory, Series B;1990-04
4. Simplicial decompositions of graphs: a survey of applications;Discrete Mathematics;1989-05
5. Simplicial minors and decompositions of graphs;Mathematical Proceedings of the Cambridge Philosophical Society;1988-05