Treelike snarks

zbMath1351.05068arXiv1601.00870MaRDI QIDQ727053

Tomáš Kaiser, Giuseppe Mazzuoccolo, Marién Abreu, Domenico Labbate

Publication date: 6 December 2016

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

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

zbMATH Keywords

snarksexcessive indexcircular flow number

Mathematics Subject Classification ID

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

Related Items (15)

Covering a cubic graph by 5 perfect matchings ⋮ A unified approach to construct snarks with circular flow number 5 ⋮ Ban–Linial's Conjecture and treelike snarks ⋮ Deciding whether four perfect matchings can cover the edges of a snark is NP-complete ⋮ Some snarks are worse than others ⋮ Perfect matching covers of cubic graphs of oddness 2 ⋮ An equivalent formulation of the Fan-Raspaud Conjecture and related problems ⋮ Berge-Fulkerson coloring for infinite families of snarks ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Cubic Graphs with No Short Cycle Covers ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Normal 6-edge-colorings of some bridgeless cubic graphs ⋮ Perfect Matching Index versus Circular Flow Number of a Cubic Graph ⋮ Morphology of small snarks ⋮ A class of cubic graphs satisfying Berge conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On snarks that are far from being 3-edge colorable
• The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
• Generation and properties of snarks
• Perfect matchings with restricted intersection in cubic graphs
• Snarks without small cycles
• Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
• Odd 2-factored snarks
• Circuit Double Cover of Graphs
• On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
• The equivalence of two conjectures of Berge and Fulkerson
• On Perfect Matching Coverings and Even Subgraph Coverings
• On (k,d)-colorings and fractional nowhere-zero flows
• Halin graphs and the travelling salesman problem
• 1‐Factor and Cycle Covers of Cubic Graphs
• On the strong circular 5‐flow conjecture
• Blocking and anti-blocking pairs of polyhedra
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Treelike snarks