Average degrees of edge-chromatic critical graphs

DOI10.1016/J.DISC.2019.02.014zbMath1464.05144arXiv1708.01279OpenAlexW2962791791WikidataQ128296195 ScholiaQ128296195MaRDI QIDQ1999729

Fuliang Lu, Huiqing Liu, Yan Cao, Su-yun Jiang, Guantao Chen

Publication date: 27 June 2019

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

Full work available at URL: https://arxiv.org/abs/1708.01279

zbMATH Keywords

Vizing's adjacency lemmaedge-\(k\)-coloringedge-critical graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ Double Vizing fans in critical class two graphs ⋮ On the average degree of edge chromatic critical graphs ⋮ Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic index of multigraphs without large triangles
• On critical graphs with chromatic index 4
• On the size of edge-chromatic critical graphs
• On the size of edge chromatic critical graphs
• Hamiltonicity of edge-chromatic critical graphs
• On the average degree of edge chromatic critical graphs
• The average degree of an edge-chromatic critical graph
• The size of edge chromatic critical graphs with maximum degree 6
• Some remarks on a paper by Vizing on critical graphs
• The average degree of an edge‐chromatic critical graph II
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: Average degrees of edge-chromatic critical graphs