(k,+)-distance-hereditary graphs☆
Under an Elsevier user license
open archive
Keywords
Interconnection networks
Dilation number
Distance-hereditary graphs
Characterization of graph classes
Forbidden subgraphs
Recognition algorithms
Cited by (0)
- ☆
A preliminary version of this paper has been presented in [S. Cicerone, G. D'Ermiliis, G. Di Stefano, in: Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01), in: Lecture Notes in Comput. Sci., Vol. 2204, Springer, Berlin, 2001, pp. 66–77]. Partially supported by the Human Potential Programme of the European Union under contract no. HPRN-CT-1999-00104 (AMORE) and by the Italian MURST Project “Teoria dei Grafi ed Applicazioni”.
Copyright © 2003 Elsevier B.V. All rights reserved.