The parity of the number of 1-factors of a graph

DOI10.1016/0012-365X(72)90083-0zbMath0229.05131OpenAlexW1995927482MaRDI QIDQ2550034

Charles H. C. Little

Publication date: 1972

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

Full work available at URL: https://doi.org/10.1016/0012-365x(72)90083-0

Mathematics Subject Classification ID

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

Related Items (6)

Factors of trees ⋮ Defect-d matchings in graphs with cyclomatic numbers 0,1 and 2 ⋮ Matchings and spanning trees in boolean weighted graphs ⋮ Trees with 1-factors and oriented trees ⋮ Pivots, determinants, and perfect matchings of graphs ⋮ Spectral aspects of symmetric matrix signings

Cites Work

• A combinatorial proof of Cayley's theorem on Pfaffians

This page was built for publication: The parity of the number of 1-factors of a graph