On (K_q,k) vertex stable graphs with minimum size

DOI10.1016/J.DISC.2011.04.017MaRDI QIDQ432707zbMATH OpenOpenAlexFDO

Authors Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Paweł Wojda

Publication date 4 July 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.04.017

zbMATH Keywords

stable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• On \((K_{q},k)\) stable graphs with small \(k\)
• On (\(K_q;k\))-stable graphs
• (H,k) stable graphs with minimum size
• On minimum \((K_q, k)\) stable graphs
• On vertex stability with regard to complete bipartite subgraphs

Cites work

• (H,k) stable graphs with minimum size
• Extremal \(k\)-edge-Hamiltonian hypergraphs
• Graph theory
• On \((K_q,k)\) vertex stable graphs with minimum size
• On vertex stability with regard to complete bipartite subgraphs
• \((H,k)\) stable bipartite graphs with minimum size

Cited in

(13)

• Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
• A lower bound on the size of \((H;1)\)-vertex stable graphs
• On \((K_q,k)\) vertex stable graphs with minimum size
• On (\(K_q;k\))-stable graphs
• A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES
• On \((K_{q},k)\) stable graphs with small \(k\)
• A generalization of an independent set with application to (K_q; k)-stable graphs
• General lower bound on the size of \((H; k)\)-stable graphs
• Minimum \(k\)-critical bipartite graphs
• On minimum \((K_q, k)\) stable graphs
• On vertex stability with regard to complete bipartite subgraphs
• \(\mathcal{P}\)-apex graphs
• (H,k) stable graphs with minimum size

This page was built for publication: On \((K_q,k)\) vertex stable graphs with minimum size

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