Perfect matchings in planar cubic graphs

DOI10.1007/S00493-012-2660-9MaRDI QIDQ2454587zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

co cutedgecubic graphnumber of perfect matchingsplanar cubic graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

Cites work

• Counting 1-factors in regular bipartite graphs
• Matching theory

Cited in

(24)

• Cuts in matchings of 3-connected cubic graphs
• Core index of perfect matching polytope for a 2-connected cubic graph
• 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
• Perfect matchings and genus of some Cartesian products of graphs
• scientific article; zbMATH DE number 5130820 (Why is no real title available?)
• A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
• Randomly colouring graphs (a combinatorial view)
• Perfect matchings in claw-free cubic graphs
• Exponentially many perfect matchings in cubic graphs
• Perfect matching in bipartite hypergraphs subject to a demand graph
• The expected number of perfect matchings in cubic planar graphs
• Perfect pseudo-matchings in cubic graphs
• Graph threading
• Fullerene graphs have exponentially many perfect matchings
• Perfect matchings with restricted intersection in cubic graphs
• An improved linear bound on the number of perfect matchings in cubic graphs

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)