A note on reducing resistance in snarks

DOI10.2989/16073606.2022.2053605zbMATH Open1518.05054OpenAlexW4223481618MaRDI QIDQ6132722FDOQ6132722

Authors: Imran Allie 

Publication date: 14 July 2023

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2022.2053605

Recommendations

• Oddness to resistance ratios in cubic graphs
• Snarks with resistance \(n\) and flow resistance \(2n\)
• Measures of edge-uncolorability of cubic graphs
• Measures of edge-uncolorability
• Measurements of edge-uncolorability

zbMATH Keywords

resistancesnarksflow resistancevertex reductions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• Classification and characterizations of snarks
• Nowhere-zero 6-flows
• Snarks with resistance \(n\) and flow resistance \(2n\)
• Measures of edge-uncolorability of cubic graphs
• Oddness to resistance ratios in cubic graphs
• 3-critical subgraphs of snarks

Cited In (10)

• Flow resistance to resistance ratios in cubic graphs
• Oddness to resistance ratios in cubic graphs
• Weak oddness as an approximation of oddness and resistance in cubic graphs
• Reducible 3-critical graphs
• 3-critical subgraphs of snarks
• A faster test for 4-flow-criticality in snarks
• Measures of edge-uncolorability of cubic graphs
• Measurements of edge-uncolorability
• Coverings of cubic graphs and 3-edge colorability
• Snarks with resistance \(n\) and flow resistance \(2n\)

This page was built for publication: A note on reducing resistance in snarks

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