Bibliographic Details
| Title: |
Anti-factors of Regular Bipartite Graphs. |
| Authors: |
Hongliang Lu1, Wei Wang1, Juan Yan2 |
| Superior Title: |
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2020, Vol. 22 Issue 1, p1-9. 9p. |
| Subject Terms: |
*BIPARTITE graphs, *POLYNOMIAL time algorithms, *SUBGRAPHS, *ALGORITHMS, *GRAPH theory |
| Abstract: |
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´asz and Plummer 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) 6= 1 for all v ∈ Y . Cornuéjols answered this question in the affirmative. Yu and Liu 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |