Back to Search
Start Over
Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs.
- Source :
-
Graphs & Combinatorics . Nov2021, Vol. 37 Issue 6, p2595-2599. 5p. - Publication Year :
- 2021
-
Abstract
- We construct an infinite family of counterexamples to Thomassen's conjecture that the vertices of every 3-connected, cubic graph on at least 8 vertices can be colored blue and red such that the blue subgraph has maximum degree at most 1 and the red subgraph minimum degree at least 1 and contains no path on 4 vertices. [ABSTRACT FROM AUTHOR]
- Subjects :
- *LOGICAL prediction
Subjects
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 37
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 153556139
- Full Text :
- https://doi.org/10.1007/s00373-021-02380-z