On vertex stability with regard to complete bipartite subgraphs

DOI10.7151/DMGT.1521zbMATH Open1217.05112OpenAlexW1974725983MaRDI QIDQ2997591FDOQ2997591

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

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

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)

Cited In (10)

• \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
• A lower bound on the size of \((H;1)\)-vertex stable graphs
• On vertex stability of complete k-partite graphs
• On \((K_q,k)\) vertex stable graphs with minimum size
• On (\(K_q;k\))-stable graphs
• A generalization of an independent set with application to \((K_q; k)\)-stable graphs
• \((H,k)\) stable bipartite graphs with minimum size
• General lower bound on the size of \((H; k)\)-stable graphs
• \(\mathcal{P}\)-apex graphs
• Title not available (Why is that?)

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)