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

Hikoe Enomoto, Katsuhiro Ota, Mikio Kano

Research output: Contribution to journalArticle

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

Fingerprint

Bipartite Graph
Sufficient Conditions
Theorem
Generalization

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

A sufficient condition for a bipartite graph to have a k‐factor. / Enomoto, Hikoe; Ota, Katsuhiro; Kano, Mikio.

In: Journal of Graph Theory, Vol. 12, No. 1, 1988, p. 141-151.

Research output: Contribution to journalArticle

Enomoto, Hikoe ; Ota, Katsuhiro ; Kano, Mikio. / A sufficient condition for a bipartite graph to have a k‐factor. In: Journal of Graph Theory. 1988 ; Vol. 12, No. 1. pp. 141-151.
@article{199da833ddee491fa68d9ca06feaa005,
title = "A sufficient condition for a bipartite graph to have a k‐factor",
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.",
author = "Hikoe Enomoto and Katsuhiro Ota and Mikio Kano",
year = "1988",
doi = "10.1002/jgt.3190120115",
language = "English",
volume = "12",
pages = "141--151",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

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

AU - Enomoto, Hikoe

AU - Ota, Katsuhiro

AU - Kano, Mikio

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84986506321&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986506321&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190120115

DO - 10.1002/jgt.3190120115

M3 - Article

AN - SCOPUS:84986506321

VL - 12

SP - 141

EP - 151

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -