Bounds for the Independence Number of Critical Graphs

DOI10.1112/S0024609399006645zbMath1020.05050OpenAlexW2142687224MaRDI QIDQ4487665

Gunnar Brinkmann, Stefan Grünewald, Eckhard Steffen, Sheshayya A. Choudum

Publication date: 22 June 2000

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s0024609399006645

zbMATH Keywords

chromatic index

Mathematics Subject Classification ID

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

Related Items (9)

REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 ⋮ Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ Independence number of edge‐chromatic critical graphs ⋮ A note on Vizing's independence number conjecture of edge chromatic critical graphs ⋮ 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 ⋮ An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs

This page was built for publication: Bounds for the Independence Number of Critical Graphs