On k-independence critical graphs
From MaRDI portal
Publication:2906868
Recommendations
- Publication:4735212
- On the \(k\)-independence number of graphs
- On some conjectures concerning critical independent sets of a graph
- Critical independent sets and König-Egerváry graphs
- On the \(k\)-independence number in graphs
- scientific article; zbMATH DE number 31760
- Bounds for the Independence Number of Critical Graphs
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- Critical independent sets of König-Egerváry graphs
- On independent domination critical graphs and \(k\)-factor critical.
Cited in
(14)- The \(k\)-independent graph of a graph
- Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers
- Computing and Combinatorics
- \(k\)-independence stable graphs upon edge removal
- A note on graphs contraction-critical with respect to independence number
- scientific article; zbMATH DE number 5912077 (Why is no real title available?)
- On vertex independence number of uniform hypergraphs
- Graphs with given \(k\)-independence number
- On the existence of (k,l)-critical graphs
- Maximal k-independent sets in graphs
- On the \(k\)-independence number in graphs
- scientific article; zbMATH DE number 1778147 (Why is no real title available?)
- Critical independent sets and König-Egerváry graphs
- Criticality of outer-connected independence upon edge removal
This page was built for publication: On \(k\)-independence critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906868)
