On 3-cut reductions of minimally 1-factorable cubic bigraphs

DOI10.1016/S0012-365X(00)00327-7zbMath0979.05089MaRDI QIDQ5937598

Domenico Labbate

Publication date: 4 November 2001

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

zbMATH Keywords

1-factorization3-cut reductionscubic bigraphpermanent

Mathematics Subject Classification ID

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

Related Items (5)

Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs ⋮ 2-factor Hamiltonian graphs. ⋮ Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs ⋮ Odd 2-factored snarks ⋮ A counterexample to the pseudo 2-factor isomorphic graph conjecture

This page was built for publication: On 3-cut reductions of minimally 1-factorable cubic bigraphs