Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs

Authors:
Andreas Brandstädt;Feodor F. Dragan;Ekkehard Köhler
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
2000

Citing 0
Cited 5

On linear and circular structure of (claw, net)-free graphs

Discrete Applied Mathematics
Induced matchings in asteroidal triple-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs

Journal of Parallel and Distributed Computing
On Distance-3 Matchings and Induced Matchings

Graph Theory, Computational Intelligence and Thought
On distance-3 matchings and induced matchings

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.