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

DOI10.1051/RO/2023018zbMATH Open1518.05087MaRDI QIDQ6041212FDOQ6041212

Authors: Yuying Li, Kexiang Xu 

Publication date: 26 May 2023

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

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

zbMATH Keywords

graph saturationcyclomatic numbersaturation number

Mathematics Subject Classification ID

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

Cited In (5)

• Minimum \(t P_3\)-saturation graphs
• Extremal problems on saturation for the family of $k$-edge-connected graphs
• MinimumK_{2, 3}-Saturated Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)