On two-factors of bipartite regular graphs

DOI10.1016/0012-365X(82)90079-6zbMath0486.05043WikidataQ56001791 ScholiaQ56001791MaRDI QIDQ1164645

J. D. Horton

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cycle space2-factorbipartite k-regular graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

On Finding Hamiltonian Cycles in Barnette Graphs ⋮ Cuts in matchings of 3-connected cubic graphs ⋮ The minimality of the Georges–Kelmans graph ⋮ Non-Hamiltonian bicubic graphs ⋮ Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ Bipartite cubic graphs and a shortness exponent ⋮ Non-Hamiltonian 3-connected cubic bipartite graphs ⋮ Connected \(k\)-factors in bipartite graphs

Cites Work

• Unnamed Item
• On the 2-factors of bicubic graphs
• On Representatives of Subsets
• Polytopes, graphs, and complexes
• The Factorization of Linear Graphs

This page was built for publication: On two-factors of bipartite regular graphs