Pages that link to "Item:Q976154"
From MaRDI portal
The following pages link to An improved linear bound on the number of perfect matchings in cubic graphs (Q976154):
Displaying 10 items.
- The cost of perfection for matchings in graphs (Q299061) (← links)
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Perfect matchings with restricted intersection in cubic graphs (Q976153) (← links)
- Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings (Q2449125) (← links)
- Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496) (← links)
- (Q3424884) (← links)
- Unions of perfect matchings in cubic graphs (Q3439362) (← links)
- Enumerating perfect matchings of a Halin graph (Q5209404) (← links)
- Connected cubic graphs with the maximum number of perfect matchings (Q6057662) (← links)