Bipartizing fullerenes

DOI10.1016/j.ejc.2012.03.028zbMath1243.05195arXiv1106.0420OpenAlexW2914210329MaRDI QIDQ427819

Bernard Lidický, Zdeněk Dvořák, Riste Škrekovski

Publication date: 18 June 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.0420

zbMATH Keywords

cubic bridgeless planar graph with twelve 5-facesfullerene graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) 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 (4)

Nice pairs of odd cycles in fullerene graphs ⋮ Critical graphs for the chromatic edge-stability number ⋮ On the anti-Kekulé number and odd cycle transversal of regular graphs ⋮ Nordhaus-Gaddum and other bounds for the chromatic edge-stability number

Cites Work

• Fullerene graphs have exponentially many perfect matchings
• Cyclic edge-cuts in fullerene graphs
• Computing the bipartite edge frustration of fullerene graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Bipartizing fullerenes