Using the graph p-distance coloring algorithm for partitioning atoms of some fullerenes

Abstract

A molecular graph p-distance coloring is a partitioning of atoms in such a way that there are no path of distance less than or equal to p between the atoms of each set. A fullerene graph is a planar 3-connected cubic graph whose faces are pentagons and hexagons. In this paper we apply some existing coloring algorithms for partitioning atoms of fullerenes based on their distances from each other. We also use these algorithm for coloring faces of some fullerenes.