Existence of perfect matchings in a plane bipartite graph
Czechoslovak Mathematical Journal, Tome 60 (2010) no. 2, pp. 489-494
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
We give a necessary and sufficient condition for the existence of perfect matchings in a plane bipartite graph in terms of elementary edge-cut, which extends the result for the existence of perfect matchings in a hexagonal system given in the paper of F. Zhang, R. Chen and X. Guo (1985).
Classification :
05C10, 05C70, 05C75
Keywords: elementary edge-cut; hexagonal system; perfect matching; plane bipartite graph
Keywords: elementary edge-cut; hexagonal system; perfect matching; plane bipartite graph
@article{CMJ_2010__60_2_a13,
author = {Che, Zhongyuan},
title = {Existence of perfect matchings in a plane bipartite graph},
journal = {Czechoslovak Mathematical Journal},
pages = {489--494},
publisher = {mathdoc},
volume = {60},
number = {2},
year = {2010},
mrnumber = {2657963},
zbl = {1224.05398},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2010__60_2_a13/}
}
Che, Zhongyuan. Existence of perfect matchings in a plane bipartite graph. Czechoslovak Mathematical Journal, Tome 60 (2010) no. 2, pp. 489-494. http://geodesic.mathdoc.fr/item/CMJ_2010__60_2_a13/