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

Hikoe Enomoto, Katsuhiro Ota, Mikio Kano

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

P. Katerinis obtained a sufficient condition for the existence of a 2‐factor in a bipartite graph, in the spirit of Hall's theorem. We show a sufficient condition for the existence of a k‐factor in a bipartite graph, as a generalization of Katerinis's theorem and Hall's theorem.

Original languageEnglish
Pages (from-to)141-151
Number of pages11
JournalJournal of Graph Theory
Volume12
Issue number1
DOIs
Publication statusPublished - 1988
Externally publishedYes

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'A sufficient condition for a bipartite graph to have a k‐factor'. Together they form a unique fingerprint.

Cite this