On the average degree of critical graphs with maximum degree six

DOI10.1016/J.DISC.2011.06.029zbMATH Open1238.05147OpenAlexW2162026130MaRDI QIDQ409377FDOQ409377

Jibin Qu, Qingbo Sun, Lianying Miao

Publication date: 13 April 2012

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

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

Recommendations

• The size of edge chromatic critical graphs with maximum degree 6
• The average degree of an edge-chromatic critical graph
• On the average degree of edge chromatic critical graphs
• On Gallai's conjecture for graphs with maximum degree 6
• Average degrees of edge-chromatic critical graphs
• Maximum average degree of list-edge-critical graphs and Vizing's conjecture
• scientific article
• The average degree of edge chromatic critical graphs with maximum degree seven
• The average degree of a subcubic edge-chromatic critical graph
• scientific article; zbMATH DE number 5279355

zbMATH Keywords

average degreecritical graphedge chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On critical graphs with chromatic index 4
• On the size of edge-chromatic critical graphs
• Planar graphs of maximum degree seven are Class I
• The size of edge chromatic critical graphs with maximum degree 6
• Every planar graph with maximum degree 7 is of class 1
• The average degree of an edge-chromatic critical graph
• On small graphs critical with respect to edge colourings

Cited In (4)

• Title not available (Why is that?)
• The spectral radius of edge chromatic critical graphs
• Title not available (Why is that?)
• Graph edge coloring: a survey

This page was built for publication: On the average degree of critical graphs with maximum degree six

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