Measures of edge-uncolorability

DOI10.1016/J.DISC.2011.09.020zbMATH Open1234.05098OpenAlexW1778416622MaRDI QIDQ658079FDOQ658079

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• Generation and properties of snarks
• Three measures of edge-uncolorability
• Title not available (Why is that?)
• Measures of edge-uncolorability of cubic graphs
• A note on reducing resistance in snarks

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)