Snarks with resistance \(n\) and flow resistance \(2n\)

DOI10.37236/10633zbMath1486.05080OpenAlexW4220657460MaRDI QIDQ2121784

Imran Allie, Edita Máčajová, Martin Škoviera

Publication date: 4 April 2022

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

Full work available at URL: https://doi.org/10.37236/10633

zbMATH Keywords

snarkBerge's conjectureBoole coloringTait coloringTutte's 5-flow conjectureresistance of a cubic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21)

Related Items (2)

A note on reducing resistance in snarks ⋮ Flow resistance to resistance ratios in cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsely intersecting perfect matchings in cubic graphs
• Generation and properties of snarks
• Measures of edge-uncolorability of cubic graphs
• 3-flows with large support
• Classification and characterizations of snarks
• Oddness to resistance ratios in cubic graphs
• Double covers of cubic graphs with oddness 4
• Measurements of edge-uncolorability
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• 1‐Factor and Cycle Covers of Cubic Graphs
• Blocking and anti-blocking pairs of polyhedra
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Snarks with resistance \(n\) and flow resistance \(2n\)