48 search results - page 1 / 10 » The Hamiltonian problem on distance-hereditary graphs |
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
SWAT
1994
Springer
13 years 9 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
WG
2004
Springer
13 years 10 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
JGAA
2007
13 years 4 months ago
2007
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3
CCCG
2006
13 years 6 months ago
2006
We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such...