Minimum C_k-saturated graphs

zbMATH Open1274.05240MaRDI QIDQ2857396FDOQ2857396

Authors: Younjin Kim, Zoltán Füredi 

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S157106531100151X

Recommendations

• Cycle-saturated graphs with minimum number of edges
• Cycle-saturated graphs of minimum size
• tK\(_p\)-saturated graphs of minimum size
• Constructive upper bounds for cycle-saturated graphs of minimum size
• Constructive upper bounds for cycle-saturated graphs of minimum size

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• Saturated graphs with minimal number of edges
• A survey of minimum saturated graphs
• A Problem in Graph Theory
• On generalized graphs
• An extremal problem for two families of sets
• All minimum \(C_{5}\)-saturated graphs
• Minimum C₅‐saturated graphs
• The saturation function of complete partite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• An extremal problem for sets with applications to graph theory
• Title not available (Why is that?)
• tK\(_p\)-saturated graphs of minimum size
• Cycle-saturated graphs of minimum size
• Constructive upper bounds for cycle-saturated graphs of minimum size
• On maximal triangle‐free graphs
• Onk-saturated graphs with restrictions on the degrees
• Title not available (Why is that?)

Cited In (25)

• Few \(H\) copies in \(F\)-saturated graphs
• Constructive upper bounds for cycle-saturated graphs of minimum size
• Minimum \(t P_3\)-saturation graphs
• All minimum \(C_{5}\)-saturated graphs
• \(C_{2k}\)-saturated graphs with no short odd cycles
• Cycle-saturated graphs with minimum number of edges
• \(C_{3}\) saturated graphs
• Title not available (Why is that?)
• Min-max and max-min graph saturation parameters
• Minimum \((n,k,t)\) clique graphs
• Cycle-saturated graphs of minimum size
• Minimum C₅‐saturated graphs
• Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
• tK\(_p\)-saturated graphs of minimum size
• Uniquely cycle-saturated graphs
• Constructive upper bounds for cycle-saturated graphs of minimum size
• On the saturation spectrum of odd cycles
• MinimumK_{2, 3}-Saturated Graphs
• On the number of edges in a minimum \(C_6\)-saturated graph
• Title not available (Why is that?)
• Minimizing the number of edges in (P_k ∪ K₃)-saturated connected graphs
• Weakly saturated hypergraphs and a conjecture of Tuza
• Minimum clique-free subgraphs of Kneser graphs
• Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
• Saturation for the 3-uniform loose 3-cycle

This page was built for publication: Minimum \(C_k\)-saturated graphs

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