Subdivision into i-packings and S-packing chromatic number of some lattices
Affiliation auteurs | !!!! Error affiliation !!!! |
Titre | Subdivision into i-packings and S-packing chromatic number of some lattices |
Type de publication | Journal Article |
Year of Publication | 2015 |
Auteurs | Gastineau N, Kheddouci H, Togni O |
Journal | ARS MATHEMATICA CONTEMPORANEA |
Volume | 9 |
Pagination | 331-354 |
Type of Article | Article |
ISSN | 1855-3966 |
Mots-clés | distance 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 |
DOI | 10.26493/1855-3974.436.178 |