Back to Search
Start Over
Counterexamples to Thomassen’s Conjecture on Decomposition of Cubic Graphs
- Source :
- Bellitto , T , Klimošová , T , Merker , M , Witkowski , M & Yuditsky , Y 2021 , ' Counterexamples to Thomassen’s Conjecture on Decomposition of Cubic Graphs ' , Graphs and Combinatorics , vol. 37 , no. 6 , pp. 2595-2599 .
- 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.
Details
- Database :
- OAIster
- Journal :
- Bellitto , T , Klimošová , T , Merker , M , Witkowski , M & Yuditsky , Y 2021 , ' Counterexamples to Thomassen’s Conjecture on Decomposition of Cubic Graphs ' , Graphs and Combinatorics , vol. 37 , no. 6 , pp. 2595-2599 .
- Notes :
- application/pdf, English
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.on1372614795
- Document Type :
- Electronic Resource