On vertex stability of complete k-partite graphs

DOI10.7494/OPMATH.2015.35.6.907zbMATH Open1330.05087OpenAlexW648956562MaRDI QIDQ3467572FDOQ3467572

Authors: Mateusz Nikodem 

Publication date: 3 February 2016

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2015.35.6.907

Recommendations

• On vertex stability with regard to complete bipartite subgraphs
• scientific article; zbMATH DE number 4103104
• On strongly stable graphs and some consequences for partitionable graphs
• On \((C_n;k)\) stable graphs
• On (\(K_q;k\))-stable graphs
• Stability results for vertex Turán problems in Kneser graphs
• On the chromatic vertex stability number of graphs
• An extremal problem for vertex partition of complete multipartite graphs
• Publication:3035150
• scientific article; zbMATH DE number 4212099

zbMATH Keywords

vertex stabilitycomplete \(k\)-partite graphsminimal stable graphs

Mathematics Subject Classification ID

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

Cites Work

• A lower bound on the size of \((H;1)\)-vertex stable graphs

Cited In (3)

• \((H,k)\) stable bipartite graphs with minimum size
• On vertex stability with regard to complete bipartite subgraphs
• Title not available (Why is that?)

This page was built for publication: On vertex stability of complete k-partite graphs

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