Subdivision into i-packings and S-packing chromatic number of some lattices

Affiliation auteurs!!!! Error affiliation !!!!
TitreSubdivision into i-packings and S-packing chromatic number of some lattices
Type de publicationJournal Article
Year of Publication2015
AuteursGastineau N, Kheddouci H, Togni O
JournalARS MATHEMATICA CONTEMPORANEA
Volume9
Pagination331-354
Type of ArticleArticle
ISSN1855-3966
Mots-clésdistance coloring, hexagonal lattice, i-packing, Packing chromatic number, square lattice, Triangular lattice
Résumé

{An i-packing in a graph G is a set of vertices at pairwise distance greater than i. For a nondecreasing sequence of integers S = (s(1), s(2),...), the S-packing chromatic number of a graph G is the least integer k such that there exists a coloring of G into k colors where each set of vertices colored i

DOI10.26493/1855-3974.436.178