We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
International audienceAn i-packing in a graph G is a set of vertices at pairwise distance greater than i. For a nondecreasing sequence of integers S=(s1​,s2​,…), 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, i=1,…,k, is an si​-packing.This paper describes various subdivisions of an i-packing into j-packings (j>i) for the hexagonal, square andtriangular lattices. These results allow us to bound the S-packing chromatic number for these graphs, with more precisebounds and exact values for sequences S=(si​,i∈N∗), si​=d+⌊(i−1)/n⌋
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.