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