Three measures of edge-uncolorability

DOI10.1016/J.DISC.2010.10.001zbMATH Open1225.05098OpenAlexW2053590742MaRDI QIDQ616368FDOQ616368

Authors Martin Kochol

Publication date 7 January 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2010.10.001

zbMATH Keywords

edge-coloringpathnowhere-zero flowmulti-terminal network

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Measures of edge-uncolorability
• Measurements of edge-uncolorability
• Measures of edge-uncolorability of cubic graphs
• Three edge-coloring conjectures
• Edge-coloring of 3-uniform hypergraphs
• scientific article; zbMATH DE number 3977022
• Conjectures on uniquely 3-edge-colorable graphs
• The size of edge-critical uniquely 3-colorable planar graphs
• Size of edge-critical uniquely 3-colorable planar graphs
• scientific article; zbMATH DE number 3878955

Cites work

• Classification and characterizations of snarks
• Complexity of approximation of 3-edge-coloring of graphs
• Five cycle double covers of some cubic graphs
• Graphes Cubiques D'Indice Chromatique Quatre
• Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs
• Measurements of edge-uncolorability
• Measures of edge-uncolorability
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows

Cited in

(7)

• Flows in signed graphs with two negative edges
• On snarks that are far from being 3-edge colorable
• Measures of edge-uncolorability
• Measurements of edge-uncolorability
• Oddness to resistance ratios in cubic graphs
• Measures of edge-uncolorability of cubic graphs
• Minimal edge colorings of class 2 graphs and double graphs

This page was built for publication: Three measures of edge-uncolorability

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