# Sharp Upper Bounds on the Clar Number of Fullerene Graphs

Discussiones Mathematicae Graph Theory (2018)

- Volume: 38, Issue: 1, page 155-163
- ISSN: 2083-5892

## Access Full Article

top## Abstract

top## How to cite

topYang Gao, and Heping Zhang. "Sharp Upper Bounds on the Clar Number of Fullerene Graphs." Discussiones Mathematicae Graph Theory 38.1 (2018): 155-163. <http://eudml.org/doc/288576>.

@article{YangGao2018,

abstract = {The Clar number of a fullerene graph with n vertices is bounded above by ⌊n/6⌋ − 2 and this bound has been improved to ⌊n/6⌋ − 3 when n is congruent to 2 modulo 6. We can construct at least one fullerene graph attaining the upper bounds for every even number of vertices n ≥ 20 except n = 22 and n = 30.},

author = {Yang Gao, Heping Zhang},

journal = {Discussiones Mathematicae Graph Theory},

keywords = {fullerene; Clar number; Clar set; leapfrog transformation},

language = {eng},

number = {1},

pages = {155-163},

title = {Sharp Upper Bounds on the Clar Number of Fullerene Graphs},

url = {http://eudml.org/doc/288576},

volume = {38},

year = {2018},

}

TY - JOUR

AU - Yang Gao

AU - Heping Zhang

TI - Sharp Upper Bounds on the Clar Number of Fullerene Graphs

JO - Discussiones Mathematicae Graph Theory

PY - 2018

VL - 38

IS - 1

SP - 155

EP - 163

AB - The Clar number of a fullerene graph with n vertices is bounded above by ⌊n/6⌋ − 2 and this bound has been improved to ⌊n/6⌋ − 3 when n is congruent to 2 modulo 6. We can construct at least one fullerene graph attaining the upper bounds for every even number of vertices n ≥ 20 except n = 22 and n = 30.

LA - eng

KW - fullerene; Clar number; Clar set; leapfrog transformation

UR - http://eudml.org/doc/288576

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.