Perfect matchings in planar cubic graphs
From MaRDI portal
Publication:2454587
DOI10.1007/s00493-012-2660-9zbMath1299.05263OpenAlexW2164264448WikidataQ60781968 ScholiaQ60781968MaRDI QIDQ2454587
Maria Chudnovsky, P. D. 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
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (15)
Fullerene graphs have exponentially many perfect matchings ⋮ Perfect matching in bipartite hypergraphs subject to a demand graph ⋮ A superlinear bound on the number of perfect matchings in cubic bridgeless graphs ⋮ Non-degenerated ground states and low-degenerated excited states in the antiferromagnetic Ising model on triangulations ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings ⋮ An improved linear bound on the number of perfect matchings in cubic graphs ⋮ Exponentially many perfect matchings in cubic graphs ⋮ On some structural properties of generalized fullerene graphs with 13 pentagonal faces ⋮ Polynomial degeneracy for the first \(m\) energy levels of the antiferromagnetic Ising model ⋮ Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions ⋮ On the expected number of perfect matchings in cubic planar graphs ⋮ Counting perfect matchings in the geometric dual ⋮ Cubic bridgeless graphs have more than a linear number of perfect matchings ⋮ Complete forcing numbers of catacondensed hexagonal systems
Cites Work
This page was built for publication: Perfect matchings in planar cubic graphs
