Finding a central vertex in an HHD-free graph

DOI10.1016/S0166-218X(02)00419-5zbMath1022.05080MaRDI QIDQ1408816

Feodor F. Dragan, Victor Chepoi

Publication date: 25 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

distanceschordal graphsdistance-hereditary graphefficient algorithmscentral vertexHHD-free graphshouse-hole-domino-free

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

On claw-free asteroidal triple-free graphs ⋮ Lexbfs-orderings and powers of hhd-free graphs^∗ ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ Easy computation of eccentricity approximating trees ⋮ Undirected Graphs of Entanglement 2 ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak bipolarizable graphs
• A Helly theorem in weakly modular space
• Computation of the center and diameter of outerplanar graphs
• On the semi-perfect elimination
• A simple linear-time algorithm for computing the center of an interval graph
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• On brittle graphs
• Centers of 2–Trees
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Convexity and HHD-Free Graphs
• Dominating cliques in distance-hereditary graphs

This page was built for publication: Finding a central vertex in an HHD-free graph