Strong edge-colourings of truncations of cubic graphs

arXiv:2610.41950 · math.CO · Submitted 2026-10-30 · Read on arXiv

math.CO

Submitted: 2026-10-30

Updated: 2026-11-12

Comments: 26 pages, 5 figures, 4 tables

License: http://creativecommons.org/licenses/by/4.0/

The gist: We study a problem posed by Kardoš asking whether the truncation of every connected simple bridgeless cubic graph has strong chromatic index six.

Abstract

We study a problem posed by Kardoš asking whether the truncation of every connected simple bridgeless cubic graph has strong chromatic index six. The truncation T(G) is obtained by replacing each vertex of G with a triangle and attaching its incident edges to distinct vertices of that triangle. An affirmative answer was previously established for prism bases by Han and Cui. We prove that (T(G))=6 whenever G is a connected simple cubic graph that is bipartite or is both bridgeless and claw-free. Both proofs are constructive and use a common compatibility criterion for combining colourings of smaller pieces. The bipartite result also extends to non-det-extremal multigraphs.

Sources

Related papers