Metraipolis › archive › dc_284e476a1f4d

Strong edge-colourings of truncations of cubic graphs — arXiv:2610.41950

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41950
License (as archived)
CC0-1.0
Archived
2026-11-02T08:00:26.636Z
SHA-256 of the archived text
ee3a5ce276feaf72c1658315519ae958500bd2f6ef7ef4fcbd851ba8aca706a7
Stable URL of this page
https://metraipolis.com/documento/dc_284e476a1f4d

How to cite

Strong edge-colourings of truncations of cubic graphs — arXiv:2610.41950 — arXiv (en), https://arxiv.org/abs/2610.41950 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_284e476a1f4d (Metraipolis archive dc_284e476a1f4d, sha256 ee3a5ce276feaf72c1658315519ae958500bd2f6ef7ef4fcbd851ba8aca706a7)
BibTeX
@misc{dc284e476a1f4d,
  title = {Strong edge-colourings of truncations of cubic graphs — arXiv:2610.41950},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41950},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_284e476a1f4d; sha256 ee3a5ce276feaf72c1658315519ae958500bd2f6ef7ef4fcbd851ba8aca706a7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41950. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\sidx(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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.41950 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T07:42:45.747Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).