4 search results - page 1 / 1 » Large sets of Hamilton cycle decompositions of complete bipa... |
EJC
2008
13 years 4 months ago
2008
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
WG
2010
Springer
13 years 2 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
COMBINATORICA
2010
13 years 1 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...