论文信息 - Almost All Regular Graphs Are Hamiltonian

Almost All Regular Graphs Are Hamiltonian

In a previous article the authors showed that almost all labelled cubic graphs are hamiltonian. In the present article, this result is used to show that almost all r‐regular graphs are hamiltonian for any fixed r ⩾ 3, by an analysis of the distribution of 1‐factors in random regular graphs. Moreover, almost all such graphs are r‐edge‐colorable if they have an even number of vertices. Similarly, almost all r‐regular bipartite graphs are hamiltonian and r‐edge‐colorable for fixed r ⩾ 3. © 1994 John Wiley & Sons, Inc.g1

Nicholas C. Wormald | Robert W. Robinson | R. W. Robinson | N. Wormald

[1] Nicholas C. Wormald,et al. The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.

[2] Brendan D. McKay,et al. The number of matchings in random regular graphs and bipartite graphs , 1986, J. Comb. Theory, Ser. B.

[3] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[4] Alan M. Frieze,et al. Finding hamilton cycles in sparse random graphs , 1987, J. Comb. Theory, Ser. B.

[5] Edward A. Bender,et al. The asymptotic number of non-negative integer matrices with given row and column sums , 1974, Discret. Math..

[6] Nicholas C. Wormald,et al. Existence of long cycles in random cubic graphs , 1984 .

[7] Alan M. Frieze,et al. Hamiltonian cycles in random regular graphs , 1984, J. Comb. Theory, Ser. B.

[8] N. Wormald. Some problems in the enumeration of labelled graphs , 1980, Bulletin of the Australian Mathematical Society.

[9] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[10] Nicholas C. Wormald,et al. Almost All Cubic Graphs Are Hamiltonian , 1992, Random Struct. Algorithms.