Counterexamples to Thomassen's conjecture on decomposition of cubic graphs

DOI10.1007/s00373-021-02380-zzbMath1479.05295arXiv1908.06697OpenAlexW3186189658WikidataQ113905210 ScholiaQ113905210MaRDI QIDQ2053720

Tereza Klimošová, Thomas Bellitto, Martin Merker, Yelena Yuditsky, Marcin Witkowski

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.06697

zbMATH Keywords

cubic graphsgraph decompositionThomassen's conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen

Cites Work

• The square of a planar cubic graph is 7-colorable
• Decomposition of cubic graphs related to Wegner's conjecture

This page was built for publication: Counterexamples to Thomassen's conjecture on decomposition of cubic graphs