How to decrease the diameter of triangle-free graphs

DOI10.1007/s004930050035zbMath0924.05038OpenAlexW2063190536MaRDI QIDQ1307443

Miklós Ruszinkó, András Gyárfás

Publication date: 31 October 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050035

zbMATH Keywords

extremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (14)

Fast Algorithms for Diameter-Optimally Augmenting Paths ⋮ A Polynomial-Time Algorithm for Outerplanar Diameter Improvement ⋮ A polynomial-time algorithm for outerplanar diameter improvement ⋮ Vertex fusion under diameter constraints ⋮ Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees ⋮ Decompositions into Subgraphs of Small Diameter ⋮ Bounded edge-connectivity and edge-persistence of Cartesian product of graphs ⋮ Decreasing the diameter of bounded degree graphs ⋮ Augmenting forests to meet odd diameter requirements ⋮ Improved approximability and non-approximability results for graph diameter decreasing problems ⋮ Vertex fusion under distance constraints ⋮ Shortcut sets for the locus of plane Euclidean networks ⋮ Augmenting Outerplanar Graphs to Meet Diameter Requirements ⋮ Reducing the diameter of a unit disk graph via node addition

This page was built for publication: How to decrease the diameter of triangle-free graphs