Bounds for the Independence Number of Critical Graphs

DOI10.1112/S0024609399006645MaRDI QIDQ4487665zbMATH OpenOpenAlexFDO

Authors Gunnar Brinkmann, Stefan Grünewald, Eckhard Steffen, S. 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

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

Recommendations

• A new upper bound for the independence number of edge chromatic critical graphs
• On the independence number of edge chromatic critical graphs
• On the independence number of edge chromatic critical graphs.
• A note on Vizing's independence number conjecture 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

Cited in

(18)

• A new upper bound for the independence number of edge chromatic critical graphs
• Color-critical graphs with independent cutset
• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• A note on graphs contraction-critical with respect to independence number
• scientific article; zbMATH DE number 5912077 (Why is no real title available?)
• Vizing's 2-factor conjecture involving toughness and maximum degree conditions
• On the independence number of edge chromatic critical graphs
• scientific article; zbMATH DE number 4122024 (Why is no real title available?)
• The independence number of an edge-chromatic critical graph
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• The critical independence number and an independence decomposition
• On k-independence critical graphs
• Approximating Vizing's independence number conjecture
• On a problem concerning ordered colourings
• An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
• Critical independent sets and König-Egerváry graphs
• Independence number of edge‐chromatic critical graphs
• REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487665)