On the independence number of edge chromatic critical graphs

DOI10.7151/dmgt.1753zbMath1295.05179OpenAlexW2044207866MaRDI QIDQ2509546

Wen Yao Song, Lian-Ying Miao, Shi-you Pang, Zheng-Ke Miao

Publication date: 28 July 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1753

zbMATH Keywords

edge coloringindependence numberedge-chromatic critical graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
• Planar graphs of maximum degree seven are Class I
• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• The independence number of an edge-chromatic critical graph
• The size of edge chromatic critical graphs with maximum degree 6
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• Bounds for the Independence Number of Critical Graphs
• The average degree of an edge‐chromatic critical graph II
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: On the independence number of edge chromatic critical graphs