A generalization of an independent set with application to \((K_q; k)\)-stable graphs
From MaRDI portal
Publication:741777
DOI10.1016/j.dam.2013.08.036zbMath1300.05238OpenAlexW2080181361MaRDI QIDQ741777
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.036
Related Items (2)
Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ Minimum \(k\)-critical bipartite graphs
Cites Work
- Unnamed Item
- On \((K_q,k)\) vertex stable graphs with minimum size
- On \((K_{q},k)\) stable graphs with small \(k\)
- A lower bound on the size of \((H;1)\)-vertex stable graphs
- Extremal \(P_4\)-stable graphs
- On \((C_n;k)\) stable graphs
- Extremal \(k\)-edge-Hamiltonian hypergraphs
- On (Kq;k)-Stable Graphs
- On vertex stability with regard to complete bipartite subgraphs
- (H,k) stable graphs with minimum size
- (H,k) stable bipartite graphs with the minimum size
This page was built for publication: A generalization of an independent set with application to \((K_q; k)\)-stable graphs
