Minimum \(t P_3\)-saturation graphs

DOI10.1016/j.dam.2022.12.012zbMath1506.05106OpenAlexW4313368222MaRDI QIDQ2112662

Mei Lu, Zhen He, Zequn Lv

Publication date: 11 January 2023

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.12.012

zbMATH Keywords

pathsubgraphsaturation number

Mathematics Subject Classification ID

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

Cites Work

• Saturation numbers for linear forests \(P_5\cup tP_2\)
• Saturation numbers of books
• tK\(_p\)-saturated graphs of minimum size
• Saturation numbers for \(t P_k\) with \(k\) less than 6
• 1-Faktoren von Graphen. (1-factors of graphs)
• Minimum C₅‐saturated graphs
• Saturated graphs with minimal number of edges
• Cycle-Saturated Graphs with Minimum Number of Edges
• Saturation Number for Linear Forest 2P3 ∪ tP2
• A Problem in Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum \(t P_3\)-saturation graphs