Edge-coloring critical graphs with high degree

DOI10.1016/S0012-365X(02)00395-3zbMATH Open1007.05054OpenAlexW2074423918MaRDI QIDQ1850002FDOQ1850002

Authors: Lianying Miao, Jian-Liang Wu 

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00395-3

Recommendations

• An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
• Edge coloring regular graphs of high degree
• scientific article; zbMATH DE number 4168720
• Color critical hypergraphs with many edges
• scientific article; zbMATH DE number 7511519
• Edge coloring graphs with large minimum degree
• Edge-colouring of regular graphs of large degree
• A conclusion on the properties of edge-coloring critical graphs
• Colour-critical graphs with few edges
• A note on vertex-criticality with respect to edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (7)

• Edge colorings of planar graphs without 5-cycles with two chords
• Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
• Edge colorings of planar graphs without 6-cycles with three chords
• The edge colorings of \(K_5\)-minor free graphs
• Edge coloring of planar graphs without adjacent 7-cycles
• An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
• On the size of edge-coloring critical graphs with maximum degree 4

This page was built for publication: Edge-coloring critical graphs with high degree

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