Characterizing intersection classes of graphs
- 31 July 1985
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 55 (2) , 185-193
- https://doi.org/10.1016/0012-365x(85)90047-0
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- 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
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972