On vertex stability with regard to complete bipartite subgraphs

DOI10.7151/DMGT.1521MaRDI QIDQ2997591zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• \((H,k)\) stable bipartite graphs with minimum size
• On vertex stability of complete k-partite graphs
• On (\(K_q;k\))-stable graphs
• On \((K_q,k)\) vertex stable graphs with minimum size
• (H,k) stable graphs with minimum size

Cited in

(10)

• 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
• scientific article; zbMATH DE number 4103104 (Why is no real title available?)
• On \((K_q,k)\) vertex stable graphs with minimum size
• On (\(K_q;k\))-stable graphs
• A lower bound on the size of \((H;1)\)-vertex stable graphs
• \(\mathcal{P}\)-apex graphs
• \((H,k)\) stable bipartite graphs with minimum size
• On vertex stability of complete k-partite graphs
• \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs

This page was built for publication: On vertex stability with regard to complete bipartite subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997591)