On the saturation spectrum of families of cycle subdivisions

DOI10.1016/J.TCS.2023.113941MaRDI QIDQ6159028FDOQ6159028

Authors Rongling Lang, Hui Lei, Junxue Zhang 

Publication date 1 June 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

edge spectrumextremal numberssaturation numberscycle subdivisions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Saturation numbers for families of graph subdivisions
• On the saturation spectrum of odd cycles
• Cycle-saturated graphs of minimum size
• On the number of edges in a minimum \(C_6\)-saturated graph

Cites work

• Maximal circuits of graphs. I
• Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
• On maximal paths and circuits of graphs
• On the edge spectrum of saturated graphs for paths and stars
• On the non-\((p-1)\)-partite \(K_p\)-free graphs
• Saturation numbers for families of graph subdivisions
• Size in maximal triangle-free graphs and minimal graphs of diameter 2
• The edge spectrum of \(K_4\)-saturated graphs
• The edge spectrum of \(K_4^-\)-saturated graphs
• The edge spectrum of the saturation number for small paths

Cited in

(1)

• Linear saturation numbers of Berge-\(C_3\) and Berge-\(C_4\)

This page was built for publication: On the saturation spectrum of families of cycle subdivisions

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