Almost diameter of a house-hole-free graph in linear time via LexBFS

DOI10.1016/S0166-218X(99)00077-3zbMath0933.05143MaRDI QIDQ1302159

Feodor F. Dragan

Publication date: 22 March 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00077-3

zbMATH Keywords

diameter; eccentricity; asteroidal triple-free graph; linear-time algorithm; lexicographic breadth-first search; house-hole-domino-free graph; house-hole-free graph

Mathematics Subject Classification ID

05C12: Distance in graphs

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

On the power of BFS to determine a graph's diameter, Fast approximation of eccentricities and distances in hyperbolic graphs, Diameter determination on restricted graph families, The diameter of AT‐free graphs, End-vertices of LBFS of (AT-free) bigraphs, A new characterization of HH-free graphs, On end-vertices of lexicographic breadth first searches, Beyond Helly graphs: the diameter problem on absolute retracts, Computing Giant Graph Diameters, Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number