On (K_q;k)-stable graphs
From MaRDI portal
Publication:2853339
DOI10.1002/JGT.21705zbMATH Open1273.05147OpenAlexW1597081027MaRDI QIDQ2853339FDOQ2853339
Authors: 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
Recommendations
- On \((K_{q},k)\) stable graphs with small \(k\)
- On \((C_n;k)\) stable graphs
- On minimum \((K_q, k)\) stable graphs
- On \((K_q,k)\) vertex stable graphs with minimum size
- \(\alpha_k\)- and \(\gamma_k\)-stable graphs
- On \(\alpha^{+}\)-stable König-Egerváry graphs
- scientific article; zbMATH DE number 1161356
- On \(\alpha^{++}\)-stable graphs
- ON STABLE GRAPHS
- On \(q\)-graphs
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35)
Cites Work
Cited In (17)
- Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
- Title not available (Why is that?)
- A lower bound on the size of \((H;1)\)-vertex stable graphs
- On vertex stability of complete k-partite graphs
- On \((K_q,k)\) vertex stable graphs with minimum size
- On \((K_{q},k)\) stable graphs with small \(k\)
- A generalization of an independent set with application to \((K_q; k)\)-stable graphs
- On \((C_n;k)\) stable graphs
- Title not available (Why is that?)
- General lower bound on the size of \((H; k)\)-stable graphs
- Extremal \(P_4\)-stable graphs
- Minimum \(k\)-critical bipartite graphs
- On minimum \((K_q, k)\) stable graphs
- Near packings of two 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\))-stable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853339)
