Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10438269" target="_blank" >RIV/00216208:11320/21:10438269 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=e978ulbdkC" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=e978ulbdkC</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00373-021-02380-z" target="_blank" >10.1007/s00373-021-02380-z</a>

Result language
angličtina
Original language name
Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GJ19-04113Y" target="_blank" >GJ19-04113Y: Advanced tools in combinatorics, topology and related areas</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)