On k-independence critical graphs
From MaRDI portal
Publication:2906868
zbMATH Open1256.05162MaRDI QIDQ2906868FDOQ2906868
Authors: Mustapha Chellali, Nader Jafari Rad
Publication date: 5 September 2012
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p289.pdf
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 (10)
- 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
- Title not available (Why is that?)
- On vertex independence number of uniform hypergraphs
- On the existence of \((k,l)\)-critical graphs
- Maximal k-independent sets in graphs
- Title not available (Why is that?)
- Critical independent sets and König-Egerváry graphs
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)