The size of edge chromatic critical graphs with maximum degree 6

DOI10.1002/jgt.20351zbMath1247.05083OpenAlexW4240192033MaRDI QIDQ3605165

Yue Zhao, Lian-Ying Miao, Rong Luo

Publication date: 20 February 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20351

zbMATH Keywords

edge chromatic numberclass oneclass twoedge chromatic critical graphs

Mathematics Subject Classification ID

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

Related Items

A note on the size of edge-chromatic 4-critical graphs, Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5, Face-degree bounds for planar critical graphs, REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4, On edge colorings of 1-toroidal graphs, On the size of critical graphs with small maximum degree, A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture, Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\), On the size of edge chromatic 5-critical graphs, Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees, The average degree of edge chromatic critical graphs with maximum degree seven, On the average degree of critical graphs with maximum degree six, On edge colorings of 1-planar graphs without adjacent triangles, Remarks on planar edge-chromatic critical graphs, On edge colorings of 1-planar graphs without 5-cycles with two chords, On the average degree of edge chromatic critical graphs, Some sufficient conditions for 1-planar graphs to be class 1, Edge colorings of planar graphs without 6-cycles with three chords, Average degrees of edge-chromatic critical graphs, On the size of critical graphs with maximum degree 8, On the independence number of edge chromatic critical graphs, Upper bounds on the maximum degree of class two graphs on surfaces, A sufficient condition for an IC-planar graph to be class 1, A new upper bound for the independence number of edge chromatic critical graphs, Finding Δ(Σ) for a Surface Σ of Characteristic −4, An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs, Edge coloring of graphs with small maximum degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Chromatic index critical graphs of order 9
• On critical graphs with chromatic index 4
• On small graphs critical with respect to edge colourings
• Chromatic-index-critical graphs of orders 11 and 12
• On the size of edge-chromatic critical graphs
• Planar graphs of maximum degree seven are Class I
• Chromatic-index-critical graphs of orders 13 and 14
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Every planar graph with maximum degree 7 is of class 1