Publication Title

SIAM Journal on Computing

Publication Date

2000

Document Type

Article

Disciplines

Computer Sciences

Abstract

We prove that claw-free graphs, containing an induced dominating path, have a Hamiltonian path, and that 2-connected claw-free graphs, containing an induced doubly dominating cycle or a pair of vertices such that there exist two internally disjoint induced dominating paths connecting them, have a Hamiltonian cycle. As a consequence, we obtain linear time algorithms for both problems if the input is restricted to (claw,net)-free graphs. These graphs enjoy those interesting structural properties.

Comments

Copyright 2000 Society for Industrial and Applied Mathematics.


Share

COinS