论文信息 - On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into k packings with pairwise different widths. Several lower and upper bounds are obtained for the packing chromatic number of Cartesian products of graphs. It is proved that the packing chromatic number of the infinite hexagonal lattice lies between 6 and 8. Optimal lower and upper bounds are proved for subdivision graphs. Trees are also considered and monotone colorings are introduced.

[1] S. L. Fitzpatrick,et al. Distributive online channel assignment for hexagonal cellular networks with constraints , 2004, Discret. Appl. Math..

[2] Janez Zerovnik,et al. 2-local 5/4-competitive Algorithm for Multicoloring Triangle-free Hexagonal Graphs , 2004, Inf. Process. Lett..

[3] V. G. Vizing. The cartesian product of graphs , 1963 .

[4] Bostjan Bresar,et al. On the independence graph of a graph , 2003, Discret. Math..

[5] W. Imrich,et al. Product Graphs: Structure and Recognition , 2000 .

[6] Sundar Vishwanathan,et al. A technique for multicoloring triangle-free hexagonal graphs , 2005, Discret. Math..

[7] Christian Sloper. AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 29 (2004), Pages 309–321 An eccentric coloring of trees , 2022 .

[8] Douglas F. Rall,et al. On the independence number of the Cartesian product of caterpillars , 2001, Ars Comb..

[9] Sandi Klavzar,et al. On independence numbers of the cartesian product of graphs , 1996, Ars Comb..

[10] Sandi Klavzar. Some new bounds and exact results on the independence number of Cartesian product graphs , 2005, Ars Comb..

[11] Wayne Goddard,et al. Braodcast Chromatic Numbers of Graphs , 2008, Ars Comb..

[12] P. K. Jha. Perfect r-domination in the Kronecker product of three cycles , 2002 .