Recognizing HHDS-free graphs

Authors:
Stavros D. nikolopoulos;Leonidas Palios
Affiliations:
Department of Computer Science, University of Ioannina, Ioannina, Greece;Department of Computer Science, University of Ioannina, Ioannina, Greece
Venue:
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Year:
2005

Citing 9
Cited 1

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
All variations on perfectly orderable graphs

Journal of Combinatorial Theory Series B
On the complexity of recognizing perfectly orderable graphs

Discrete Mathematics
Meyniel weakly triangulated graphs—I: co-perfect orderability

Discrete Applied Mathematics
Homogeneously orderable graphs

Theoretical Computer Science
Graph classes: a survey

Graph classes: a survey
Finding houses and holes in graphs

Theoretical Computer Science
The Steiner Tree Problem and Homogeneous Sets

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Recognizing HHD-free and welsh-powell opposition graphs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

On the Complexity of Finding a Sun in a Graph

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In particular, we describe a simple O(n2m)-time algorithm which determines whether a graph G on n vertices and m edges is HHDS-free. To the best of our knowledge, this is the first polynomial-time algorithm for recognizing this class of graphs.