The size of edge chromatic critical graphs with maximum degree 6
From MaRDI portal
Publication:3605165
DOI10.1002/jgt.20351zbMath1247.05083MaRDI 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
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C07: Vertex degrees
Related Items
REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4, A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture, The average degree of edge chromatic critical graphs with maximum degree seven, A note on the size of edge-chromatic 4-critical graphs, Face-degree bounds for planar critical graphs, On edge colorings of 1-toroidal graphs, Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees, On the average degree of critical graphs with maximum degree six, On edge colorings of 1-planar graphs without adjacent triangles, Some sufficient conditions for 1-planar graphs to be class 1, Remarks on planar edge-chromatic critical graphs, On the size of critical graphs with maximum degree 8, 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, On edge colorings of 1-planar graphs without 5-cycles with two chords, Edge colorings of planar graphs without 6-cycles with three chords, Average degrees of edge-chromatic critical graphs, A sufficient condition for an IC-planar graph to be class 1, On the average degree of edge chromatic critical graphs, Upper bounds on the maximum degree of class two graphs on surfaces, Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\), On the size of edge chromatic 5-critical graphs, On the independence number of edge chromatic critical graphs, Finding Δ(Σ) for a Surface Σ of Characteristic −4, On the size of critical graphs with small maximum degree, A new upper bound for the independence number of edge chromatic critical graphs, Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
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
