Approximating Vizing's independence number conjecture

zbMath1404.05160arXiv1609.00808MaRDI QIDQ4616100

Eckhard Steffen

Publication date: 30 January 2019

Full work available at URL: https://arxiv.org/abs/1609.00808

zbMATH Keywords

edge-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 (4)

Fractional matchings, component-factors and edge-chromatic critical graphs ⋮ Independence number of edge‐chromatic critical graphs ⋮ Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs ⋮ Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• The independence number of an edge-chromatic critical graph
• A new upper bound for the independence number of edge chromatic critical graphs
• Chromatic-index-critical graphs of even order
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• Bounds for the Independence Number of Critical Graphs

This page was built for publication: Approximating Vizing's independence number conjecture