109 search results - page 2 / 22 » Hamiltonian Connected Line Graphs |
JCT
2006
13 years 6 months ago
2006
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order and minimum degree +6 10 is Hamiltonian for sufficiently large. In this paper, we prove that if...
COMBINATORICS
2006
13 years 6 months ago
2006
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
DM
2008
13 years 6 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
JUCS
2007
13 years 6 months ago
2007
: In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of th...
CCCG
2001
13 years 7 months ago
2001
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. ...