Existence of perfect matchings in a plane bipartite graph

Zhongyuan Che

doi:10.1007/s10587-010-0029-z

Existence of perfect matchings in a plane bipartite graph

Zhongyuan Che

Penn State Beaver

Research output: Contribution to journal › Article › peer-review

Abstract

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)
Pages (from-to)	489-494
Number of pages	6
Journal	Czechoslovak Mathematical Journal
Volume	60
Issue number	2
DOIs	https://doi.org/10.1007/s10587-010-0029-z
State	Published - 2010

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.1007/s10587-010-0029-z

Cite this

@article{75b6c30afc6e4ba39016fdcdd7517f52,

title = "Existence of perfect matchings in a plane bipartite graph",

abstract = "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).",

author = "Zhongyuan Che",

year = "2010",

doi = "10.1007/s10587-010-0029-z",

language = "English (US)",

volume = "60",

pages = "489--494",

journal = "Czechoslovak Mathematical Journal",

issn = "0011-4642",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Existence of perfect matchings in a plane bipartite graph

AU - Che, Zhongyuan

PY - 2010

Y1 - 2010

N2 - 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).

AB - 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).

UR - https://www.scopus.com/pages/publications/77953702662

UR - https://www.scopus.com/pages/publications/77953702662#tab=citedBy

U2 - 10.1007/s10587-010-0029-z

DO - 10.1007/s10587-010-0029-z

M3 - Article

AN - SCOPUS:77953702662

SN - 0011-4642

VL - 60

SP - 489

EP - 494

JO - Czechoslovak Mathematical Journal

JF - Czechoslovak Mathematical Journal

IS - 2

ER -

Existence of perfect matchings in a plane bipartite graph

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this