A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Regular n-valent n-connected nonHamiltonian non-n-edge-colorable graphs
1973
Journal of combinatorial theory. Series B (Print)
For all n ~> 3, regular n-valent nonHamiltonian non-n-edge-colorable graphs with an even ntunber of vertices are constructed. For n @ 5, 6, or 7, these graphs are n-connected.
doi:10.1016/s0095-8956(73)80006-1
fatcat:czehutdzpnh35ltg5q6egzbthy