PERFECT MATCHINGS AND GENUS OF SOME CARTESIAN PRODUCTS OF GRAPHS

DOI10.1142/S1793830912500267zbMath1251.05141MaRDI QIDQ3166732

Fuliang Lu, Lian Zhu Zhang, Feng-Gen Lin

Publication date: 15 October 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

Cartesian productgenusperfect matchingimbedding

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Asymptotic enumeration (05A16) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Construction of k-matchings in graph products

Cites Work

• Remark on the dimer problem
• Perfect matchings and perfect squares
• Matchings in graphs on non-orientable surfaces
• Permanents, Pfaffian orientations, and even directed circuits
• Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
• Genus of cartesian products of regular bipartite graphs
• Thermodynamic limit of the six-vertex model with domain wall boundary conditions
• Enumeration of perfect matchings in graphs with reflective symmetry
• Unnamed Item

This page was built for publication: PERFECT MATCHINGS AND GENUS OF SOME CARTESIAN PRODUCTS OF GRAPHS