On 2-factor Hamiltonian regular bipartite graphs (Q2250805)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6319180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On 2-factor Hamiltonian regular bipartite graphs |
scientific article; zbMATH DE number 6319180 |
Statements
On 2-factor Hamiltonian regular bipartite graphs (English)
0 references
21 July 2014
0 references
\textit{M. Funk} et al. [J. Comb. Theory, Ser. B 87, No. 1, 138--144 (2003; Zbl 1045.05061)] proved that if each \(2\)-factor of a \(k\)-regular bipartite graph is Hamiltonian then \(k\leq 3\). In this paper a new proof of this claim is provided.
0 references
2-factor Hamiltonian
0 references
bipartite graphs
0 references
0 references
0.92928326
0 references
0.9255142
0 references
0.92145395
0 references
0.9084196
0 references
0 references
0.9053383
0 references
