(H,k) stable graphs with minimum size

DOI10.7151/dmgt.1397zbMath1152.05035OpenAlexW2091580321MaRDI QIDQ3527532

Artur Szymański, Aneta Dudek, Małgorzata Zwonek

Publication date: 29 September 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1397

zbMATH Keywords

cyclesstable graphscomplete graphsminimum size

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (10)

Largest component and node fault tolerance for grids ⋮ 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 ⋮ Near packings of two 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

This page was built for publication: (H,k) stable graphs with minimum size