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 audienceGiven a non-decreasing sequence S=(s1​,s2​,…,sk​) of positive integers, an {\em S-packing coloring} of a graph G is a mapping c from V(G) to {s1​,s2​,…,sk​} such that any two vertices with color si​ are at mutual distance greater than si​, 1≤i≤k. This paper studies S-packing colorings of (sub)cubic graphs. We prove that subcubic graphs are (1,2,2,2,2,2,2)-packing colorable and (1,1,2,2,3)-packing colorable. For subdivisions of subcubic graphs we derive sharper bounds, and we provide an example of a cubic graph of order 38 which is not (1,2,…,12)-packing colorable
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.