language-icon Old Web
English
Sign In

Coloring of fullerenes

2018 
A (k,6)-fullerene graph is a planar 3-connected cubic graph whose faces are k-gons and hexagons. The aim of this paper is to compute the equitable chromatic, b-chromatic and list chromatic numbers of some fullerenes.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    19
    References
    2
    Citations
    NaN
    KQI
    []