On the number of edges in a minimum \(C_6\)-saturated graph

DOI10.1007/s00373-014-1422-4zbMath1317.05097OpenAlexW1974941919MaRDI QIDQ2354620

Maiko Shigeno, Song Luo, Mingchao Zhang

Publication date: 20 July 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1422-4

zbMATH Keywords

extremal graphcycle-freeforbidden graph\(C_6\)-saturated graph

Mathematics Subject Classification ID

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

Related Items (7)

The partite saturation number of spider ⋮ Saturation for the 3-uniform loose 3-cycle ⋮ Weak saturation number of a complete bipartite graph ⋮ Saturation numbers for linear forests \(P_5\cup tP_2\) ⋮ Cycle Saturation in Random Graphs ⋮ Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs ⋮ \(C_{2k}\)-saturated graphs with no short odd cycles

Cites Work

• A survey of minimum saturated graphs
• Smallest maximally nonhamiltonian graphs
• Smallest maximally nonhamiltonian graphs. II
• Cycle-saturated graphs of minimum size
• Lower bound for the size of maximal nontraceable graphs
• All minimum C5-saturated graphs
• Minimum C₅‐saturated graphs
• Saturated graphs with minimal number of edges
• P_m-saturated bipartite graphs with minimum size
• A Problem in Graph Theory
• Variations on the Hamiltonian Theme
• Constructive upper bounds for cycle-saturated graphs of minimum size
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of edges in a minimum \(C_6\)-saturated graph