Decreasing the diameter of cycles

DOI10.1002/JGT.10122MaRDI QIDQ4422616zbMATH OpenOpenAlexFDO

Authors Elena Grigorescu

Publication date 20 August 2003

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10122

zbMATH Keywords

cyclesdiametermaximum degree

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Decreasing the diameter of bounded degree graphs
• The least possible diameter for \(C_n+3e\)
• How to decrease the diameter of triangle-free graphs
• scientific article; zbMATH DE number 5119227
• Edge addition and edge deletion of graphs

Cited in

(10)

• Revisiting cycle shrinking
• How to decrease the diameter of triangle-free graphs
• Reducing the diameter of a unit disk graph via node addition
• Diameter increase caused by edge deletion
• The Diameter of a Cycle Plus a Random Matching
• On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
• Decreasing the diameter of bounded degree graphs
• scientific article; zbMATH DE number 6792403 (Why is no real title available?)
• The least possible diameter for \(C_n+3e\)
• Improved approximability and non-approximability results for graph diameter decreasing problems

This page was built for publication: Decreasing the diameter of cycles

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