Existence of perfect matchings in a plane bipartite graph

DOI10.1007/S10587-010-0029-ZMaRDI QIDQ3073488zbMATH OpenOpenAlexFDO

Authors Zhongyuan Che

Publication date 11 February 2011

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/38021, http://hdl.handle.net/10338.dmlcz/140583

zbMATH Keywords

elementary edge-cuthexagonal systemperfect matchingplane bipartite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• A theorem concerning perfect matchings in hexagonal systems
• Perfect matchings in hexagonal systems
• On plane bipartite graphs without fixed edges
• On perfect k-matchings
• Combinatorics of perfect matchings in plane bipartite graphs and application to tilings.

Cites work

• On Representatives of Subsets
• Perfect matchings in hexagonal systems
• Perfect matchings in hexagonal systems
• Plane elementary bipartite graphs

Cited in

(8)

• Combinatorics of perfect matchings in plane bipartite graphs and application to tilings.
• scientific article; zbMATH DE number 4152424 (Why is no real title available?)
• scientific article; zbMATH DE number 4112647 (Why is no real title available?)
• scientific article; zbMATH DE number 1195272 (Why is no real title available?)
• The rotation graphs of perfect matchings of plane bipartite graphs
• A note on the number of perfect matchings of bipartite graphs
• Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph
• Perfect matchings in pruned grid graphs

This page was built for publication: Existence of perfect matchings in a plane bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073488)