An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs

DOI10.1016/j.disc.2008.06.019zbMath1200.05114OpenAlexW1965637688WikidataQ123113069 ScholiaQ123113069MaRDI QIDQ1043651

Yue Zhao, Rong Luo

Publication date: 9 December 2009

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

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

zbMATH Keywords

edge coloringindependence numbercritical graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 ⋮ On the independence number of edge chromatic critical graphs ⋮ The independence number of an edge-chromatic critical graph ⋮ Approximating Vizing's independence number conjecture ⋮ A new upper bound for the independence number of edge chromatic critical graphs

Cites Work

• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• 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
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs