Measures of edge-uncolorability

DOI10.1016/J.DISC.2011.09.020MaRDI QIDQ658079zbMATH OpenOpenAlexFDO

Authors Vahan V. Mkrtchyan, Eckhard Steffen

Publication date 11 January 2012

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(\Delta \)-edge-colorable graphresistance of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Measurements of edge-uncolorability
• Three measures of edge-uncolorability
• Measures of edge-uncolorability of cubic graphs
• scientific article; zbMATH DE number 3977022
• Measure-theoretic unfriendly colorings
• Edge k-q-colorability of graphs
• scientific article; zbMATH DE number 3857145
• On the edge multicoloring of unicyclic graphs
• Edge irredundant colorings in graphs
• Edge colouring line graphs of unicyclic graphs

Cites work

• Classification and characterizations of snarks
• Matching theory
• Maximum -edge-colorable subgraphs of class II graphs
• Three measures of edge-uncolorability

Cited in

(9)

• Minimal edge colorings of class 2 graphs and double graphs
• scientific article; zbMATH DE number 4012645 (Why is no real title available?)
• Generation and properties of snarks
• k-resistant colorings
• scientific article; zbMATH DE number 2192169 (Why is no real title available?)
• A note on reducing resistance in snarks
• Three measures of edge-uncolorability
• On resistance of graphs
• Measures of edge-uncolorability of cubic graphs

This page was built for publication: Measures of edge-uncolorability

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