No label defined (Q3222878)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3889568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3889568 |
Statements
1984
0 references
snark
0 references
Petersen graph
0 references
Four Color Theorem
0 references
factor
0 references
Hamiltonian
0 references
0.8547046184539795
0 references
0.8547044992446899
0 references
0.8187653422355652
0 references
0.7908739447593689
0 references
[For the entire collection see Zbl 0547.00011.] A snark is a biconnected, trivalent graph whose edge-chromatic number exceeds 3. W. T. Tutte's conjecture in 1967, that every snark contains a subdivision of the Petersen graph, implies the Four Color Theorem. Tutte's conjecture is in turn true if it is true for snarks containing a 2-factor consisting of exactly two circuits (of necessarily odd length). The author proves Tutte's conjecture in the case that both circuits are chordless and then cleverly generalizes his results to r-valent ''super- snarks'' for all \(r\geq 3\). In fact, r-valent graphs admitting such a 2- factor but not containing a subdivision of the Petersen graph are shown to be Hamiltonian.
0 references