Pages that link to "Item:Q2454587"
From MaRDI portal
The following pages link to Perfect matchings in planar cubic graphs (Q2454587):
Displaying 16 items.
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Fullerene graphs have exponentially many perfect matchings (Q839387) (← links)
- An improved linear bound on the number of perfect matchings in cubic graphs (Q976154) (← links)
- Polynomial degeneracy for the first \(m\) energy levels of the antiferromagnetic Ising model (Q2031487) (← links)
- On the expected number of perfect matchings in cubic planar graphs (Q2075311) (← links)
- On some structural properties of generalized fullerene graphs with 13 pentagonal faces (Q2275390) (← links)
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions (Q2285396) (← links)
- Complete forcing numbers of catacondensed hexagonal systems (Q2344000) (← links)
- Non-degenerated ground states and low-degenerated excited states in the antiferromagnetic Ising model on triangulations (Q2439698) (← links)
- Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings (Q2449125) (← links)
- Counting perfect matchings in the geometric dual (Q2840713) (← links)
- Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496) (← links)
- Perfect matching in bipartite hypergraphs subject to a demand graph (Q6099389) (← links)
- The expected number of perfect matchings in cubic planar graphs (Q6604690) (← links)
