A sufficient condition for a bipartite graph to have a k‐factor

DOI10.1002/JGT.3190120115zbMath0718.05044OpenAlexW2147621675MaRDI QIDQ5749320

Katsuhiro Ota, Hikoe Enomoto, Mikio Kano

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120115

zbMATH Keywords

existencebipartite graphk-factor

Mathematics Subject Classification ID

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

Related Items (4)

Graph factors and factorization: 1985--2003: a survey ⋮ A sufficient condition for a graph to have \([a,b\)-factors] ⋮ Binding numbers and \(f\)-factors of graphs ⋮ Connected \(k\)-factors in bipartite graphs

This page was built for publication: A sufficient condition for a bipartite graph to have a k‐factor