Perfect matchings in hexagonal systems
From MaRDI portal
Publication:5916419
DOI10.1007/BF02582965zbMath0614.05043OpenAlexW2020752263MaRDI QIDQ5916419
Rong Si Chen, Fu Ji Zhang, Xiafong Guo
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02582965
Related Items (12)
Complete forcing numbers of hexagonal systems. II ⋮ Coronoid systems with perfect matchings ⋮ Perfect matchings of polyomino graphs ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ A linear algorithm for a perfect matching in polyomino graphs ⋮ Perfect matchings of generalized polyomino graphs ⋮ Existence of perfect matchings in a plane bipartite graph ⋮ Complete forcing numbers of hexagonal systems ⋮ A theorem concerning perfect matchings in hexagonal systems ⋮ Perfect Matchings of the Small Polyominoes ⋮ The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems ⋮ Complete forcing numbers of graphs
Cites Work
This page was built for publication: Perfect matchings in hexagonal systems
