Packing chromatic number, $$\mathbf (1, 1, 2, 2) $$(1,1,2,2)-colorings, and characterizing the Petersen graph
Sign Up to like & getrecommendations! Published in 2017 at "Aequationes mathematicae"
DOI: 10.1007/s00010-016-0461-8
Abstract: The packing chromatic number $$\chi _{\rho }(G)$$χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into sets $$\Pi _1,\ldots ,\Pi _k$$Π1,…,Πk, where $$\Pi _i$$Πi,… read more here.
Keywords: graph; number; petersen graph; packing chromatic ... See more keywords
On the packing coloring of base-3 Sierpiński graphs and H-graphs
Sign Up to like & getrecommendations! Published in 2020 at "Aequationes mathematicae"
DOI: 10.1007/s00010-020-00747-w
Abstract: For a nondecreasing sequence of integers $$S=(s_1, s_2, \ldots )$$ S = ( s 1 , s 2 , … ) an S -packing k -coloring of a graph G is a mapping from V… read more here.
Keywords: graphs; base sierpi; packing coloring; sierpi ski ... See more keywords
Packing chromatic number of transformation graphs
Sign Up to like & getrecommendations! Published in 2019 at "Thermal Science"
DOI: 10.2298/tsci190720363d
Abstract: Graph coloring is an assignment of labels called colors to elements of a graph. The packing coloring was introduced by Goddard et al. [1] in 2008 which is a kind of coloring of a graph.… read more here.
Keywords: graphs; transformation graphs; packing chromatic; chromatic number ... See more keywords