Generalizations of marriage theorem for degree factors

DOI10.1007/S00373-016-1699-6zbMath1353.05096OpenAlexW2471834629MaRDI QIDQ503622

Mikio Kano, Radosław Cymer

Publication date: 13 January 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1699-6

zbMATH Keywords

bipartite graph\(f\)-factor\((g,f)\)-factordegree factormarriage theorem

Mathematics Subject Classification ID

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

Related Items (6)

Ryser's theorem for \(\rho\)-Latin rectangles ⋮ Research on fractional critical covered graphs ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ Factors of bi-regular bipartite graphs ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs

Cites Work

• Factors and factorizations of graphs. Proof techniques in factor theory
• Studies on directed graphs. I, II
• Graphs and Subgraphs
• Flows in infinite graphs

This page was built for publication: Generalizations of marriage theorem for degree factors