Naslov
All pairs of pentagons in leapfrog fullerenes are nice

Autori
Došlić, Tomislav

Izvornik
Mathematics (2227-7390) 8 (2020); 2135, 7

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
perfect matching ; nice subgraph ; fullerene graph ; leapfrog fullerene

Sažetak
A subgraph $H$ of a graph $G$ with a perfect matching is nice if $G - V(H)$ has a perfect matching. It is well known that all fullerene graphs have perfect matchings and that all fullerene graphs contain some small connected graphs as nice subgraphs. In this contribution we consider fullerene graphs arising from smaller fullerenes {;\em via}; the leapfrog transformation and show that in such graphs each pair of (necessarily disjoint) pentagons is nice. That answers in affirmative a question posed in a recent paper on nice pairs of odd cycles in fullerene graphs.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA