Construction of permutation snarks

DOI10.1016/J.JCTB.2016.05.003MaRDI QIDQ345069zbMATH OpenOpenAlexFDO

Authors 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

circuit double covercycle permutation graphsnark

Mathematics Subject Classification ID

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

Abstract: A permutation snark is a snark which has a 2-factor $F_2$ consisting of two chordless circuits; $F_2$ is called the permutation 2-factor of $G$. We construct an infinite family $mathcalH$ of cyclically 5-edge connected permutation snarks. Moreover, we prove for every member $GinmathcalH$ that the permutation 2-factor given by the construction of $G$ is not contained in any circuit double cover of $G$.

Recommendations

• scientific article; zbMATH DE number 3884206
• Superposition of snarks revisited
• Circuits of length 5 in 2-factors of cubic graphs
• Odd 2-factored snarks
• On snarks that are far from being 3-edge colorable

Cites work

• scientific article; zbMATH DE number 446493 (Why is no real title available?)
• Circuit double cover of graphs
• Compatible circuit decompositions of 4‐regular graphs
• Generation and properties of snarks
• Graph theory

Cited in

(7)

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

This page was built for publication: Construction of permutation snarks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345069)