Non-separating induced cycles in graphs
- 1 October 1981
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 31 (2) , 199-224
- https://doi.org/10.1016/s0095-8956(81)80025-1
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Special subdivisions ofK 4 and 4-chromatic graphsMonatshefte für Mathematik, 1980
- Removable Cycles in 2-Connected Graphs of Minimum Degree at Least FourJournal of the London Mathematical Society, 1980
- Concept of a vertex in a matroid and 3‐connected graphsJournal of Graph Theory, 1980
- Some graphs with chromatic number threeJournal of Combinatorial Theory, Series B, 1979
- Semi-topological subgraphsDiscrete Mathematics, 1977
- A minimal condition implying a specialK 4-subdivision in a graphArchiv der Mathematik, 1974
- kreuzungsfreiea,b-Wege in endlichen GraphenAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1974
- Zur Theorie dern-fach zusammenhängenden GraphenAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1969
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre UnterteilungenMathematische Nachrichten, 1960
- A Theorem of KuratowskiIndagationes Mathematicae, 1954