Antifactors of regular bipartite graphs

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

ver descrição completa

Detalhes bibliográficos
Main Authors: Hongliang Lu, Wei Wang, Juan Yan
Formato: Artigo
Idioma:English
Publicado em: Discrete Mathematics & Theoretical Computer Science 2020-06-01
Colecção:Discrete Mathematics & Theoretical Computer Science
Assuntos:
Acesso em linha:https://dmtcs.episciences.org/3233/pdf