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

DOI10.17654/DM018040505MaRDI QIDQ5076249zbMATHFDO

Authors Suechao Li, Bing Wei, Xuechao 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

• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
• Bounds for the Independence Number of Critical Graphs
• Edge coloring of graphs with small maximum degrees
• Every planar graph with maximum degree 7 is of class 1
• Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
• Planar graphs of maximum degree seven are Class I
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• 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

This page was built for publication: REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4

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