Graphs having circuits with at least two chords
- 1 June 1982
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 32 (3) , 264-285
- https://doi.org/10.1016/0095-8956(82)90004-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Non-separating induced cycles in graphsJournal of Combinatorial Theory, Series B, 1981
- Some graphs with chromatic number threeJournal of Combinatorial Theory, Series B, 1979
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre UnterteilungenMathematische Nachrichten, 1960