On the 2-factors of bicubic graphs

DOI10.1016/0012-365X(71)90027-6zbMath0219.05075DBLPjournals/dm/Tutte71WikidataQ56001790 ScholiaQ56001790MaRDI QIDQ2546880

William T. Tutte

Publication date: 1971

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

Mathematics Subject Classification ID

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

Related Items (12)

On Finding Hamiltonian Cycles in Barnette Graphs ⋮ Rooted Cycle Bases ⋮ 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 ⋮ On two-factors of bipartite regular graphs ⋮ 2-factors of cubic bipartite graphs ⋮ On the minimum leaf number of cubic graphs ⋮ Non-Hamiltonian 3-connected cubic bipartite graphs ⋮ Connected \(k\)-factors in bipartite graphs ⋮ Matching theory and Barnette's conjecture

Cites Work

• On Representatives of Subsets
• Polytopes, graphs, and complexes
• The Factorization of Linear Graphs

This page was built for publication: On the 2-factors of bicubic graphs