On minimally one-factorable \(r\)-regular bipartite graphs

DOI10.1016/S0012-365X(99)00241-1zbMath0952.05055OpenAlexW2069028059MaRDI QIDQ1567270

Domenico Labbate, Martin Funk

Publication date: 28 December 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00241-1

zbMATH Keywords

one-factorizationHeawood graphregular bipartite graphdet-extremal graphminimally one-factorable graphone-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

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. ⋮ Odd 2-factored snarks