On separating sets of edges in contraction-critical graphs
From MaRDI portal
Publication:2546876
DOI10.1007/BF01419610zbMath0219.05059MaRDI QIDQ2546876
Publication date: 1972
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/162249
Related Items
Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture, On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture, Cliques, minors and apex graphs, Hajos' graph-coloring conjecture: Variations and counterexamples, On the structure of \(k\)-connected graphs without \(K_{k}\)-minor, Colour-critical graphs and hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- A contraction theorem for abstract graphs
- Über trennende Eckenmengen in homomorphiekritischen Graphen
- Maximum-Minimum Sätze über Graphen
- Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
- On the structure of 5- and 6-chromatic abstract graphs.
- On odd circuits in chromatic graphs
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- The structure of k-chromatic graphs