On (K_q,k) stable graphs with small k

zbMATH Open1252.05091MaRDI QIDQ456306FDOQ456306

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

Publication date: 24 October 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i2p50

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On minimum \((K_q, k)\) stable graphs
• On \((K_q,k)\) vertex stable graphs with minimum size
• On (\(K_q;k\))-stable graphs
• (H,k) stable graphs with minimum size
• On \((C_n;k)\) stable graphs

zbMATH Keywords

stable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Cited In (6)

• 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 generalization of an independent set with application to \((K_q; k)\)-stable graphs
• On minimum \((K_q, k)\) stable graphs
• (H,k) stable graphs with minimum size

This page was built for publication: On \((K_{q},k)\) stable graphs with small \(k\)

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