General lower bound on the size of \((H; k)\)-stable graphs

DOI10.1007/s10878-013-9595-yzbMath1315.90032OpenAlexW1993027198WikidataQ59406376 ScholiaQ59406376MaRDI QIDQ2253956

Andrzej Żak

Publication date: 16 February 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9595-y

zbMATH Keywords

connectivityminimum degreevertex-stable graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Minimum \(k\)-critical bipartite graphs

Cites Work

• On \((K_q,k)\) vertex stable graphs with minimum size
• A lower bound on the size of \((H;1)\)-vertex stable graphs
• Extremal \(P_4\)-stable graphs
• On \((C_n;k)\) stable graphs
• Extremal \(k\)-edge-Hamiltonian hypergraphs
• On (Kq;k)-Stable Graphs
• 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: General lower bound on the size of \((H; k)\)-stable graphs