Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs (Q1356437): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1164054 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Hian Poh Yap / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3035306 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank | |||
Normal rank | |||
Latest revision as of 13:09, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs |
scientific article |
Statements
Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs (English)
0 references
9 June 1997
0 references
A bottleneck in a non-Tait-colourable cubic graph \(G= (V,E)\) is a minimal set \(\mathcal B\) of odd cuts such that, for any \(S\subseteq E\), either \(S\) or \(E\backslash S\) contains at least one member of \(\mathcal B\). F. Holroyd and F. Loupekine conjectured that in any non-Tait-colourable bridgeless cubic graph, the cuts of orders 3 and 5 form a bottleneck. E. Steffen proves that this conjecture is not true for any cyclically 6-edge non-Tait-colourable cubic graph.
0 references
Tait colouring
0 references
bottleneck
0 references
cubic graph
0 references
