Characterizing minimally 1-factorable \(r\)-regular bipartite graphs

DOI10.1016/S0012-365X(01)00189-3zbMath0994.05123MaRDI QIDQ1598818

Domenico Labbate

Publication date: 28 May 2002

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

zbMATH Keywords

1-factorcubic graph1-factorizationbiprtite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (6)

Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs ⋮ A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture ⋮ 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: Characterizing minimally 1-factorable \(r\)-regular bipartite graphs