Weak oddness as an approximation of oddness and resistance in cubic graphs

DOI10.1016/J.DAM.2018.02.021zbMath1387.05096arXiv1602.02949OpenAlexW2963260280WikidataQ130114035 ScholiaQ130114035MaRDI QIDQ1752608

Robert Lukot'ka, Ján Mazák

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

oddnesssnarkweak oddness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (4)

3-critical subgraphs of snarks ⋮ Cores, joins and the Fano-flow conjectures ⋮ Measures of edge-uncolorability of cubic graphs ⋮ The smallest nontrivial snarks of oddness 4

Cites Work

• Unnamed Item
• Generation and properties of snarks
• Combinatorics 79. Part II
• Classification and characterizations of snarks
• Double covers of cubic graphs with oddness 4
• Measurements of edge-uncolorability
• Five cycle double covers of some cubic graphs
• Small snarks with large oddness
• Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4

This page was built for publication: Weak oddness as an approximation of oddness and resistance in cubic graphs