601 search results - page 25 / 121 » Edge-dominating cycles in graphs |
122
click to vote
JGAA
2006
15 years 1 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
105
click to vote
SIAMDM
2010
15 years 10 days ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
107
click to vote
DM
2008
15 years 2 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...
110
click to vote
JGT
2007
15 years 1 months ago
2007
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no r-regular uniquely hamiltonian graphs when r > 22. This im...
ARSCOM
2006
15 years 2 months ago
2006
Let Za