36 search results - page 1 / 8 » On cycles through specified vertices |
DM
2008
14 years 9 months ago
2008
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
54
Voted
DM
2006
14 years 9 months ago
2006
For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35
JGT
2008
14 years 9 months ago
2008
66
Voted
JCT
2006
14 years 9 months ago
2006
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic me...
70
Voted
DM
2008
14 years 9 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, hamiltonian...