Minimum degree of bipartite graphs and the existence of k-factors

DOI10.1007/BF01787577zbMath0723.05098OpenAlexW2042847307MaRDI QIDQ757438

P. Katerinis

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1007/bf01787577

zbMATH Keywords

k-factor

Mathematics Subject Classification ID

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

Related Items (4)

Matching extension and minimum degree ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Extensions to 2-factors in bipartite graphs ⋮ Eigenvalues and [a,b‐factors in regular graphs]

Cites Work

• Minimum degree of a graph and the existence of k-factors
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum degree of bipartite graphs and the existence of k-factors