Size of weakly saturated graphs

DOI10.1016/j.disc.2005.11.085zbMath1118.05046OpenAlexW1981714520MaRDI QIDQ878645

Elżbieta Sidorowicz

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hereditary propertiessaturated graphsweakly saturated graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

Weak saturation number for multiple copies of the complete graph with a star removed ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\) ⋮ Weak saturation number of a complete bipartite graph ⋮ Weak saturation numbers of complete bipartite graphs in the clique ⋮ Weak saturation numbers for multiple copies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some variations of extremal graph problems
• Weakly P-saturated graphs
• On the theory of graphs

This page was built for publication: Size of weakly saturated graphs