论文信息 - Regular bipartite graphs with all 2-factors isomorphic - 字舞流文

Regular bipartite graphs with all 2-factors isomorphic

We prove that if G is a k-regular bipartite graph and all 2-factors of G are isomorphic then k ≤ 3.

Bill Jackson | Robert E. L. Aldred | John Sheehan | Domenico Labbate | Martin Funk | R. Aldred | B. Jackson | J. Sheehan | M. Funk | D. Labbate

[1] Bill Jackson,et al. 2-Factor hamiltonian graphs , 2003, J. Comb. Theory, Ser. B.

[2] William McCuaig. Brace generation , 2001 .

[3] Chia Gek Ling. On the number of Hamilton cycles in cubic graphs , 1995 .

[4] Robin Thomas,et al. PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS , 1997, STOC 1997.

[5] A. Thomason. Hamiltonian Cycles and Uniquely Edge Colourable Graphs , 1978 .

[6] William McCuaig. Even dicycles , 2000, J. Graph Theory.

[7] W. T. Tutte. Connectivity in graphs , 1966 .

[8] W. T. Tutte. On Hamiltonian Circuits , 1946 .

[9] C. Little. A characterization of convertible (0, 1)-matrices , 1975 .

[10] Bill Jackson,et al. Det-extremal cubic bipartite graphs , 2003, J. Graph Theory.

[11] Carsten Thomassen,et al. Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs , 1998, J. Comb. Theory, Ser. B.

[12] G. A. Dirac,et al. CONNECTIVITY IN GRAPHS (Mathematical Expositions No.15) , 1968 .

[13] Carsten Thomassen,et al. On the Number of Hamiltonian Cycles in Bipartite Graphs , 1996, Combinatorics, Probability and Computing.

[14] William McCuaig,et al. Pólya's Permanent Problem , 2004, Electron. J. Comb..