MinimumK2, 3-Saturated Graphs

DOI10.1002/jgt.21767zbMath1296.05097arXiv1012.4152OpenAlexW1788746465MaRDI QIDQ5495889

Ya-Chen Chen

Publication date: 7 August 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.4152

zbMATH Keywords

extremal graphsforbidden subgraphs\(K_{23}\)-saturated graphs

Mathematics Subject Classification ID

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

Related Items (3)

The partite saturation number of spider ⋮ The saturation number of \(K_{3,3}\) ⋮ Saturation numbers for linear forests $P_6 + tP_2$

Cites Work

• Unnamed Item
• Unnamed Item
• The saturation function of complete partite graphs
• A survey of minimum saturated graphs
• Minimum degree and the minimum size of \(K_2^t\)-saturated graphs
• Saturation numbers of books
• Asymptotic results on saturated graphs
• Saturated \(r\)-uniform hypergraphs
• Cycle-saturated graphs of minimum size
• \(C_{3}\) saturated graphs
• All minimum C5-saturated graphs
• Minimum C₅‐saturated graphs
• Saturated graphs with minimal number of edges
• Cycle-Saturated Graphs with Minimum Number of Edges
• The Minimum Size of Saturated Hypergraphs
• A Problem in Graph Theory
• On generalized graphs
• Constructive upper bounds for cycle-saturated graphs of minimum size

This page was built for publication: MinimumK_{2, 3}-Saturated Graphs