601 search results - page 66 / 121 » Edge-dominating cycles in graphs |
DM
2008
13 years 8 months ago
2008
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
CCCG
2010
13 years 10 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
ARSCOM
1998
13 years 8 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
IEEECIT
2009
IEEE
13 years 6 months ago
2009
IEEE
Recursive Dual-Net (RDN) was proposed recently as an effective, high-performance interconnection network for supercomputers with millions of nodes. A Recursive DualNet RDN(B) is r...
ESA
1999
Springer
14 years 29 days ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...