Bounds for the Independence Number of Critical Graphs
From MaRDI portal
Publication:4487665
DOI10.1112/S0024609399006645zbMath1020.05050MaRDI 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
05C15: Coloring of graphs and hypergraphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Approximating Vizing's independence number conjecture, REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4, 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, Vizing's 2-factor conjecture involving toughness and maximum degree conditions, 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, A new upper bound for the independence number of edge chromatic critical graphs