On the size of edge-coloring critical graphs with maximum degree 4

DOI10.1016/J.DISC.2007.10.013zbMath1223.05080OpenAlexW1974904207MaRDI QIDQ998479

Lian-Ying Miao, Shi-you Pang

Publication date: 28 January 2009

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

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

zbMATH Keywords

edge-coloringconjectureedge-coloring critical graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (2)

A note on the size of edge-chromatic 4-critical graphs ⋮ Graph edge coloring: a survey

Cites Work

• Unnamed Item
• On the size of edge-chromatic critical graphs
• On the size of edge chromatic critical graphs
• An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
• Edge-coloring critical graphs with high degree
• New lower bounds for the size of edge chromatic critical graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: On the size of edge-coloring critical graphs with maximum degree 4