On (Kq;k)-Stable Graphs

DOI10.1002/jgt.21705zbMath1273.05147OpenAlexW1597081027MaRDI QIDQ2853339

Andrzej Żak

Publication date: 21 October 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21705

zbMATH Keywords

complete graphsvertex stability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

\(\mathcal{P}\)-apex 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

Cites Work

• On \((K_q,k)\) vertex stable graphs with minimum size
• Extremal \(P_4\)-stable graphs
• Extremal \(k\)-edge-Hamiltonian hypergraphs
• 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: On (Kq;k)-Stable Graphs