On \((C_n;k)\) stable graphs

zbMath1229.05136MaRDI QIDQ648395

Sylwia Cichacz, Andrzej Żak, Agnieszka Goerlich, Małgorzata Zwonek

Publication date: 22 November 2011

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

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p205.html

zbMATH Keywords

\((Hk)\)-vertex stable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

\(\mathcal{P}\)-apex graphs ⋮ A lower bound on the size of \((H;1)\)-vertex stable graphs ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in 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

This page was built for publication: On \((C_n;k)\) stable graphs