Minimizing the number of edges in (Pk ∪ K3)-saturated connected graphs
From MaRDI portal
Publication:6041212
DOI10.1051/ro/2023018zbMath1518.05087MaRDI QIDQ6041212
Publication date: 26 May 2023
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
This page was built for publication: Minimizing the number of edges in (Pk ∪ K3)-saturated connected graphs