Existence of perfect matchings in a plane bipartite graph

Zhongyuan Che

Czechoslovak Mathematical Journal (2010)

  • Volume: 60, Issue: 2, page 489-494
  • ISSN: 0011-4642

Abstract

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

How to cite

top

Che, Zhongyuan. "Existence of perfect matchings in a plane bipartite graph." Czechoslovak Mathematical Journal 60.2 (2010): 489-494. <http://eudml.org/doc/38021>.

@article{Che2010,
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 = {Che, Zhongyuan},
journal = {Czechoslovak Mathematical Journal},
keywords = {elementary edge-cut; hexagonal system; perfect matching; plane bipartite graph; elementary edge-cut; hexagonal system; perfect matching; plane bipartite graph},
language = {eng},
number = {2},
pages = {489-494},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Existence of perfect matchings in a plane bipartite graph},
url = {http://eudml.org/doc/38021},
volume = {60},
year = {2010},
}

TY - JOUR
AU - Che, Zhongyuan
TI - Existence of perfect matchings in a plane bipartite graph
JO - Czechoslovak Mathematical Journal
PY - 2010
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 60
IS - 2
SP - 489
EP - 494
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).
LA - eng
KW - elementary edge-cut; hexagonal system; perfect matching; plane bipartite graph; elementary edge-cut; hexagonal system; perfect matching; plane bipartite graph
UR - http://eudml.org/doc/38021
ER -

References

top
  1. Diestel, R., Graph Theory, Springer-Verlag (2000). (2000) Zbl0957.05001MR1743598
  2. Hall, P., 10.1112/jlms/s1-10.37.26, J. London Math. Soc. 10 (1935), 26-30. (1935) Zbl0010.34503MR0771431DOI10.1112/jlms/s1-10.37.26
  3. Sachs, H., 10.1007/BF02579161, Combinatorica 4 (1984), 89-99. (1984) Zbl0542.05048MR0739417DOI10.1007/BF02579161
  4. Zhang, F., Chen, R., Guo, X., 10.1007/BF02582965, Graphs and Combinatorics 1 (1985), 383-386. (1985) Zbl0614.05043MR0951028DOI10.1007/BF02582965
  5. Zhang, H., Zhang, F., 10.1016/S0166-218X(00)00204-3, Discrete Appl. Math. 105 (2000), 291-311. (2000) Zbl0957.05085MR1780476DOI10.1016/S0166-218X(00)00204-3

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.