Pages that link to "Item:Q555602"

The following pages link to Exponentially many perfect matchings in cubic graphs (Q555602):

Displaying 27 items.

• Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048) (← links)
• Average connectivity and average edge-connectivity in graphs (Q390306) (← links)
• The extendability of matchings in strongly regular graphs (Q405235) (← links)
• A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
• Nice pairs of odd cycles in fullerene graphs (Q830896) (← links)
• Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values (Q1381251) (← links)
• Uniform generation of \(d\)-factors in dense host graphs (Q2014710) (← 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)
• Shortest perfect pseudomatchings in fullerene graphs (Q2139733) (← links)
• Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
• A bound for the number of vertices of a polytope with applications (Q2250836) (← 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)
• Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q2692777) (← links)
• Counting perfect matchings in the geometric dual (Q2840713) (← links)
• Computing the Partition Function for Perfect Matchings in a Hypergraph (Q3103630) (← links)
• An equivalent formulation of the Fan-Raspaud Conjecture and related problems (Q3298120) (← links)
• (Q3424884) (← links)
• Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows (Q5915811) (← links)
• Connected cubic graphs with the maximum number of perfect matchings (Q6057662) (← links)
• Perfect matching in bipartite hypergraphs subject to a demand graph (Q6099389) (← links)
• The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
• The expected number of perfect matchings in cubic planar graphs (Q6604690) (← links)
• Counting circuit double covers (Q6657602) (← links)