The number of matchings of low order in hexagonal systems

DOI10.1016/S0012-365X(97)00163-5zbMath0957.05073MaRDI QIDQ1584286

Bojan Mohar, Diego Klabjan

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency matrix; hexagonal systems; number of \(k\)-matchings

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Cites Work

• A linear algorithm for perfect matching in hexagonal systems
• Unnamed Item
• Unnamed Item
• Unnamed Item