Perfect matchings in planar cubic graphs
DOI10.1007/S00493-012-2660-9zbMATH Open1299.05263DBLPjournals/combinatorica/ChudnovskyS12aOpenAlexW2164264448WikidataQ60781968 ScholiaQ60781968MaRDI QIDQ2454587FDOQ2454587
Authors: Maria Chudnovsky, Paul Seymour 
Publication date: 13 June 2014
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-012-2660-9
Recommendations
- Perfect matchings in claw-free cubic graphs
- Cubic bridgeless graphs have more than a linear number of perfect matchings
- On the expected number of perfect matchings in cubic planar graphs
- Counting perfect matchings in the geometric dual
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (22)
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
- Perfect matchings with restricted intersection in cubic graphs
- Perfect matchings in claw-free cubic graphs
- Perfect matchings and genus of some Cartesian products of graphs
- An improved linear bound on the number of perfect matchings in cubic graphs
- Non-degenerated ground states and low-degenerated excited states in the antiferromagnetic Ising model on triangulations
- On some structural properties of generalized fullerene graphs with 13 pentagonal faces
- Cuts in matchings of 3-connected cubic graphs
- Fullerene graphs have exponentially many perfect matchings
- Randomly colouring graphs (a combinatorial view)
- The expected number of perfect matchings in cubic planar graphs
- Exponentially many perfect matchings in cubic graphs
- Polynomial degeneracy for the first \(m\) energy levels of the antiferromagnetic Ising model
- Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings
- On the expected number of perfect matchings in cubic planar graphs
- Cubic bridgeless graphs have more than a linear number of perfect matchings
- Perfect matching in bipartite hypergraphs subject to a demand graph
- Core index of perfect matching polytope for a 2-connected cubic graph
- Complete forcing numbers of catacondensed hexagonal systems
- Counting perfect matchings in the geometric dual
- Title not available (Why is that?)
This page was built for publication: Perfect matchings in planar cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454587)
