A faster test for 4-flow-criticality in snarks

DOI10.1016/J.ENDM.2015.07.033MaRDI QIDQ324779zbMATH OpenOpenAlexFDO

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

Publication date 17 October 2016

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

zbMATH Keywords

nowhere-zero \(k\)-flowssnarksTutte's flow conjectures

Mathematics Subject Classification ID

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

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

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• Flow-Critical Graphs
• Generation and properties of snarks
• Graph theory
• House of Graphs: a database of interesting graphs
• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• Integer flows
• The NP-Completeness of Edge-Coloring

Cited in

(4)

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

Describes a project that uses

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)