REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4

DOI10.17654/DM018040505zbMath1499.05224MaRDI QIDQ5076249

Suechao Li, Bing Wei, Xue-Chao Li

Publication date: 16 May 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

critical graphindependent numberedge chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
• 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
• Planar graphs of maximum degree seven are Class I
• The average degree of an edge-chromatic critical graph
• The independence number of an edge-chromatic critical graph
• The size of edge chromatic critical graphs with maximum degree 6
• Bounds for the Independence Number of 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: REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4