On snarks that are far from being 3-edge colorable

zbMath1335.05064arXiv1203.2015MaRDI QIDQ281587

Jonas Hägglund

Publication date: 11 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

oddnessperfect matching coverssnarksuncolorability measures

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Even cycle decompositions of index 3 by a novel coloring technique ⋮ On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings ⋮ Covering a cubic graph with perfect matchings ⋮ Petersen Cores and the Oddness of Cubic Graphs ⋮ Roman domination and independent Roman domination on graphs with maximum degree three ⋮ On total coloring and equitable total coloring of infinite snark families ⋮ Rotationally symmetric snarks from voltage graphs ⋮ Odd 2-factored snarks ⋮ Coverings of cubic graphs and 3-edge colorability ⋮ Berge-Fulkerson coloring for infinite families of snarks ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Treelike snarks ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ The smallest nontrivial snarks of oddness 4 ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44

Cites Work

• Unnamed Item
• Generation and properties of snarks
• Three measures of edge-uncolorability
• Classification and characterizations of snarks
• Double covers of cubic graphs with oddness 4
• Measurements of edge-uncolorability
• Five cycle double covers of some cubic graphs
• Snarks without small cycles
• Mácajová and Škoviera conjecture on cubic graphs
• The equivalence of two conjectures of Berge and Fulkerson
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Decompositions and reductions of snarks
• Polyhedral decompositions of cubic graphs
• Blocking and anti-blocking pairs of polyhedra
• A Contribution to the Theory of Chromatic Polynomials
• On cycle-double covers of graphs of small oddness

This page was built for publication: On snarks that are far from being 3-edge colorable