Pages that link to "Item:Q5744136"

The following pages link to Dimer–monomer model on the Towers of Hanoi graphs (Q5744136):

Displaying 12 items.

• Counting dimer coverings on self-similar Schreier graphs (Q444407) (← links)
• A survey and classification of Sierpiński-type graphs (Q516890) (← links)
• Dimer coverings on the Sierpinski gasket (Q930369) (← links)
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
• Study of dimer-monomer on the generalized Hanoi graph (Q2176229) (← links)
• Dimer coverings on the Tower of Hanoi graph (Q4972871) (← links)
• Connectivity and some other properties of generalized Sierpiński graphs (Q5155718) (← links)
• Independent sets on the Towers of Hanoi graphs (Q5357302) (← links)
• Combinatorics of the double-dimer model (Q5919125) (← links)
• Enumeration of maximum matchings in the Hanoi graphs using matching polynomials (Q6059080) (← links)
• The monopole-dimer model for Cartesian products of graphs: extended abstract (Q6103837) (← links)
• The ice model on the three-dimensional Hanoi graph (Q6607306) (← links)