Name
Abstract | ||
|---|---|---|
A rainbow subgraph of an edge-colored graph has all edges ofdistinct colors. A random d-regular graph with deven, and having edges colored randomly with d/2 of each ofn colors, has a rainbow Hamilton cycle with probabilitytending to 1 as n →∞, for fixed d≥ 8. © 2006 Wiley Periodicals, Inc. Random Struct. Alg.,2007 |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1002/rsa.v30:1/2 | Random Struct. Algorithms |
Keywords | Field | DocType |
hamilton cycle,mathematics,regular graph | Discrete mathematics,Edge coloring,Random regular graph,Combinatorics,Random graph,Line graph,Graph factorization,Cycle graph,Regular graph,Factor-critical graph,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 1-2 | 1042-9832 |
Citations | PageRank | References |
9 | 0.87 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Svante Janson | 1 | 1009 | 149.67 |
| Nicholas C. Wormald | 2 | 1506 | 230.43 |