On vertex stability with regard to complete bipartite subgraphs

DOI10.7151/dmgt.1521zbMath1217.05112OpenAlexW1974725983MaRDI QIDQ2997591

Aneta Dudek, Andrzej Żak

Publication date: 9 May 2011

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

Full work available at URL: https://semanticscholar.org/paper/0032577d0c0cdcd5928fea604e5f135d8092a2cd

zbMATH Keywords

bipartite graphminimal sizevertex stable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Sequences (mod (m)) (11B50)

Related Items (6)

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 ⋮ General lower bound on the size of \((H; k)\)-stable 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: On vertex stability with regard to complete bipartite subgraphs