Weakly P-saturated graphs

DOI10.7151/DMGT.1155MaRDI QIDQ4786786zbMATH OpenOpenAlexFDO

Authors Mieczysław Borowiecki, Elżbieta Sidorowicz

Publication date 8 January 2003

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1155

zbMATH Keywords

hereditary property

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Weak saturation numbers for graphs
• Weak saturation numbers for sparse graphs
• Weak saturation numbers for multiple copies
• Saturated graphs with minimal number of edges
• Weak saturation numbers of complete bipartite graphs in the clique

Cited in

(12)

• The weak saturation number of \(K_{2,t}\)
• Weak saturation number for multiple copies of the complete graph with a star removed
• Weak saturation numbers for multiple copies
• Size of weakly saturated graphs
• Weak saturation numbers of complete bipartite graphs in the clique
• Linearity of saturation for Berge hypergraphs
• Weakly pancyclic graphs
• Weakly saturated random graphs
• Maximal matroids in weak order posets
• Weakly saturated hypergraphs and exterior algebra
• Weak saturation numbers for graphs
• Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)

This page was built for publication: Weakly P-saturated graphs

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