LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
Authors:
- Feodor F DraganFDFeodor F Dragan
- Falk NicolaiFNFalk Nicolai
- 1 January 2000
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 98 (3) , 191-207
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Convexity and HHD-Free GraphsSIAM Journal on Discrete Mathematics, 1999
- LexBFS-orderings and powers of chordal graphsDiscrete Mathematics, 1997
- Perfect elimination orderings of chordal powers of graphsDiscrete Mathematics, 1996
- Powers of distance-hereditary graphsDiscrete Mathematics, 1995
- Dominating cliques in distance-hereditary graphs1994
- Completely separable graphsDiscrete Applied Mathematics, 1990
- Distance-Hereditary Graphs, Steiner Trees, and Connected DominationSIAM Journal on Computing, 1988
- Pseudo-modular graphsDiscrete Mathematics, 1986
- Distance-hereditary graphsJournal of Combinatorial Theory, Series B, 1986
- Perfect Graphs1980