2013/04/15 by Jonas Hägglund, Eckhard Steffen · 1 citation
Mathematics · Engineering · Computer Science · #Advanced Combinatorial Mathematics #graph theory and CDMA systems #Coding theory and cryptography
paper · pdf · doi:10.26493/1855-3974.288.11a
openalex publication_date 2013/04/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31
In this paper we study Petersen-colorings and strong Petersen-colorings on some well known families of snarks, e.g. Blanuša snarks, Goldberg snarks and flower snarks. In particular, it is shown that flower snarks have a Petersen-coloring but they do not have a strong Petersen-coloring. Furthermore it is proved that possible minimum counterexamples to Jaeger’s Petersen-coloring conjecture do not contain a specific subdivision of K 3, 3 .