A faster test for 4-flow-criticality in snarks

DOI10.1016/J.ENDM.2015.07.033zbMATH Open1347.05085OpenAlexW2207439998MaRDI QIDQ324779FDOQ324779

Brendan D. McKay, Cândida Nunes da Silva, André Breda Carneiro

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.033

Recommendations

• Critical and flow-critical snarks coincide
• Computational results and new bounds for the circular flow number of snarks
• Snarks with given real flow numbers
• Fast Algorithms forK4Immersion Testing
• A note on reducing resistance in snarks
• Detecting directed 4-cycles still faster
• A unified approach to construct snarks with circular flow number 5
• Testing consistency of quartet topologies: a parameterized approach
• Snarks with resistance \(n\) and flow resistance \(2n\)
• Faster Property Testers in a Variation of the Bounded Degree Model

zbMATH Keywords

snarksnowhere-zero \(k\)-flowsTutte's flow conjectures

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21)

Cites Work

• House of Graphs: a database of interesting graphs
• Graph theory
• A Contribution to the Theory of Chromatic Polynomials
• The NP-Completeness of Edge-Coloring
• Title not available (Why is that?)
• Generation and properties of snarks
• Flow-Critical Graphs
• Integer flows

Cited In (3)

• Morphology of small snarks
• Measures of edge-uncolorability of cubic graphs
• Critical and flow-critical snarks coincide

Uses Software

• House of Graphs

This page was built for publication: A faster test for 4-flow-criticality in snarks

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