On \((K_q,k)\) vertex stable graphs with minimum size

DOI10.1016/j.disc.2011.04.017zbMath1244.05123OpenAlexW104732203MaRDI QIDQ432707

Jean-Marie Vanherpe, Henri Thuillier, Jean-Luc Fouquet, Adam Paweł Wojda

Publication date: 4 July 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.017

zbMATH Keywords

stable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (8)

On \((K_q,k)\) vertex stable graphs with minimum size ⋮ \(\mathcal{P}\)-apex graphs ⋮ A lower bound on the size of \((H;1)\)-vertex stable graphs ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ General lower bound on the size of \((H; k)\)-stable graphs ⋮ Minimum \(k\)-critical bipartite graphs ⋮ A generalization of an independent set with application to \((K_q; k)\)-stable graphs ⋮ On (Kq;k)-Stable Graphs

Cites Work

• Unnamed Item
• On \((K_q,k)\) vertex stable graphs with minimum size
• Extremal \(k\)-edge-Hamiltonian hypergraphs
• 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: On \((K_q,k)\) vertex stable graphs with minimum size