Eccentricity-approximating trees in chordal graphs
From MaRDI portal
Publication:1567628
DOI10.1016/S0012-365X(00)00030-3zbMath0946.05024MaRDI QIDQ1567628
Publication date: 18 October 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (11)
Eccentricity Approximating Trees ⋮ Radius versus diameter in cocomparability and intersection graphs ⋮ Iterated joining of rooted trees ⋮ Helly-gap of a graph and vertex eccentricities ⋮ Eccentricity approximating trees ⋮ Eccentricity terrain of \(\delta\)-hyperbolic graphs ⋮ Easy computation of eccentricity approximating trees ⋮ Joining caterpillars and stability of the tree center ⋮ An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Eccentricity function in distance-hereditary graphs
This page was built for publication: Eccentricity-approximating trees in chordal graphs
