Reducible 3-critical graphs

DOI10.1051/ro/2023143OpenAlexW4386597765MaRDI QIDQ6181220

Imran Allie

Publication date: 22 January 2024

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2023143

zbMATH Keywords

cubic graphssnarks\(k\)-critical graphsedge-colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cites Work

• Unnamed Item
• Unnamed Item
• Measures of edge-uncolorability of cubic graphs
• Zulässige Kantenfärbungen von pseudo-regulären Graphen 3. Grades mit der Kantenfarbenzahl 3
• Classification and characterizations of snarks
• Measurements of edge-uncolorability
• Non-bicritical critical snarks
• 3-critical subgraphs of snarks
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Decompositions and reductions of snarks
• Polyhedral decompositions of cubic graphs
• A Contribution to the Theory of Chromatic Polynomials
• A note on reducing resistance in snarks

This page was built for publication: Reducible 3-critical graphs