On the dimer problem of the vertex-edge graph of a cubic graph

DOI10.1016/j.disc.2023.113427zbMath1515.05147arXiv2106.02919OpenAlexW4361204462MaRDI QIDQ6041554

Weigen Yan, Shuli Li, Danyi Li

Publication date: 31 May 2023

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

Full work available at URL: https://arxiv.org/abs/2106.02919

zbMATH Keywords

cubic graphdimer problemsilicate networkhexagonal latticevertex-edge graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (1)

Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• A complementation theorem for perfect matchings of graphs having a cellular completion
• Counting 1-factors in regular bipartite graphs
• Perfect matchings and perfect powers
• Even circuits of prescribed clockwise parity
• Enumeration of spanning trees of middle graphs
• Perfect matchings of cellular graphs
• On the number of perfect matchings of line graphs
• Permanents, Pfaffian orientations, and even directed circuits
• Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
• DIMERS ON TWO-DIMENSIONAL LATTICES
• The Complexity of Enumeration and Reliability Problems
• Graphs with 1-Factors
• PERFECT MATCHINGS OF FISHER GRAPHS OF CUBIC GRAPHS
• Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
• ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
• Enumeration of perfect matchings in graphs with reflective symmetry

This page was built for publication: On the dimer problem of the vertex-edge graph of a cubic graph