Minimizing the number of edges in (Pk ∪ K3)-saturated connected graphs

DOI10.1051/RO/2023018MaRDI QIDQ6041212zbMATH OpenFDO

Authors Yuying Li, Kexiang Xu

Publication date 26 May 2023

Published in RAIRO - Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2023018

zbMATH Keywords

cyclomatic numbergraph saturationsaturation number

Mathematics Subject Classification ID

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

Recommendations

• MinimumK_{2, 3}-Saturated Graphs
• Minimum \(t P_3\)-saturation graphs
• Minimum C_k-saturated graphs
• tK\(_p\)-saturated graphs of minimum size
• scientific article; zbMATH DE number 6843207

Cited in

(8)

• Extremal problems on saturation for the family of k-edge-connected graphs
• Minimum \(t P_3\)-saturation graphs
• scientific article; zbMATH DE number 1409250 (Why is no real title available?)
• scientific article; zbMATH DE number 975388 (Why is no real title available?)
• MinimumK_{2, 3}-Saturated Graphs
• Some results on minimum saturated graphs
• Some results on the saturation number of graphs
• Saturation numbers of balanced double stars

This page was built for publication: Minimizing the number of edges in (P_k ∪ K₃)-saturated connected graphs

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