Previous |  Up |  Next

Article

Title: Existence of perfect matchings in a plane bipartite graph (English)
Author: Che, Zhongyuan
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642 (print)
ISSN: 1572-9141 (online)
Volume: 60
Issue: 2
Year: 2010
Pages: 489-494
Summary lang: English
.
Category: math
.
Summary: 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). (English)
Keyword: elementary edge-cut
Keyword: hexagonal system
Keyword: perfect matching
Keyword: plane bipartite graph
MSC: 05C10
MSC: 05C70
MSC: 05C75
idZBL: Zbl 1224.05398
idMR: MR2657963
.
Date available: 2010-07-20T16:53:16Z
Last updated: 2020-07-03
Stable URL: http://hdl.handle.net/10338.dmlcz/140583
.
Reference: [1] Diestel, R.: Graph Theory.Springer-Verlag (2000). Zbl 0957.05001, MR 1743598
Reference: [2] Hall, P.: On representatives of subsets.J. London Math. Soc. 10 (1935), 26-30. Zbl 0010.34503, MR 0771431, 10.1112/jlms/s1-10.37.26
Reference: [3] Sachs, H.: Perfect matchings in hexagonal systems.Combinatorica 4 (1984), 89-99. Zbl 0542.05048, MR 0739417, 10.1007/BF02579161
Reference: [4] Zhang, F., Chen, R., Guo, X.: Perfect matchings in hexagonal systems.Graphs and Combinatorics 1 (1985), 383-386. Zbl 0614.05043, MR 0951028, 10.1007/BF02582965
Reference: [5] Zhang, H., Zhang, F.: Plane elementary bipartite graphs.Discrete Appl. Math. 105 (2000), 291-311. Zbl 0957.05085, MR 1780476, 10.1016/S0166-218X(00)00204-3
.

Files

Files Size Format View
CzechMathJ_60-2010-2_14.pdf 230.6Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo