Construction of permutation snarks

DOI10.1016/j.jctb.2016.05.003zbMath1350.05076arXiv1208.3230OpenAlexW2963295023MaRDI QIDQ345069

Jonas Hägglund, Arthur Hoffmann-Ostenhof

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

snarkcircuit double covercycle permutation graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items

Berge–Fulkerson coloring for C(12)‐linked permutation graphs ⋮ Some snarks are worse than others ⋮ Superposition of snarks revisited ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor ⋮ Cycle double covers and non-separating cycles

Cites Work

• Generation and properties of snarks
• Circuit Double Cover of Graphs
• Compatible circuit decompositions of 4‐regular graphs
• Unnamed Item
• Unnamed Item