论文信息 - Bipartite regular graphs and shortness parameters

Bipartite regular graphs and shortness parameters

By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k -connected k -valent bipartite graphs has shortness exponent less than one and (2) the class of cyclically 4-edge-connected trivalent bipartite graphs has shortness coefficient less than one.

Peter J. Owens

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] Peter J. Owens. On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks , 1980, J. Comb. Theory, Ser. B.

[3] G. Meredith. Regular n-valent n-connected nonHamiltonian non-n-edge-colorable graphs , 1973 .

[4] Peter J. Owens. Bipartite cubic graphs and a shortness exponent , 1983, Discret. Math..

[5] Hansjoachim Walther,et al. Shortness Exponents of Families of Graphs , 1973, J. Comb. Theory, Ser. A.

[6] Mark N. Ellingham,et al. Non-hamiltonian 3-connected cubic bipartite graphs , 1983, J. Comb. Theory, Ser. B.