ProV Logo
0
Antifactors of regular bipartite graphs
Lu, Hongliang...

Free

Antifactors of regular bipartite graphs by Lu, Hongliang ( Author )
Lemonjar Open Access
N.A
30-11-2015
Let G=(X,Y;E) be a bipartite graph, where X and Y are color classes and E is the set of edges of G. Lovász and Plummer \cite{LoPl86} asked whether one can decide in polynomial time that a given bipartite graph G=(X,Y;E) admits a 1-anti-factor, that is subset F of E such that dF(v)=1 for all v∈X and dF(v)≠1 for all v∈Y. Cornuéjols \cite{CHP} answered this question in the affirmative. Yu and Liu \cite{YL09} asked whether, for a given integer k≥3, every k-regular bipartite graph contains a 1-anti-factor. This paper answers this question in the affirmative.
-
Article
pdf
36.88 KB
English
-
MYR 0.01
-
https://arxiv.org/abs/1511.09277
Share this eBook