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).
|Original language||English (US)|
|Number of pages||6|
|Journal||Czechoslovak Mathematical Journal|
|State||Published - 2010|
All Science Journal Classification (ASJC) codes