Abstract
The packing chromatic number \(\chi _{\rho }(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\), where \(\Pi _i\), \(i\in [k]\), is an i-packing. The following conjecture is posed and studied: if G is a subcubic graph, then \(\chi _{\rho }(S(G))\le 5\), where S(G) is the subdivision of G. The conjecture is proved for all generalized prisms of cycles. To get this result it is proved that if G is a generalized prism of a cycle, then G is (1, 1, 2, 2)-colorable if and only if G is not the Petersen graph. The validity of the conjecture is further proved for graphs that can be obtained from generalized prisms in such a way that one of the two n-cycles in the edge set of a generalized prism is replaced by a union of cycles among which at most one is a 5-cycle. The packing chromatic number of graphs obtained by subdividing each of its edges a fixed number of times is also considered.
Similar content being viewed by others
References
Alegre, I., Fiol, M.A., Yebra, J.L.A.: Some large graphs with given degree and diameter. J. Graph Theory 10, 219–224 (1986)
Argiroffo, G., Nasini, G., Torres, P.: The packing coloring problem for lobsters and partner limited graphs. Discrete Appl. Math. 164, 373–382 (2014)
Brešar, B., Klavžar, S., Rall, D.F.: On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. Discrete Appl. Math. 155, 2303–2311 (2007)
Brešar, B., Klavžar, S., Rall, D.F.: Packing chromatic number of base-3 Sierpiński graphs. Graphs Comb. 32, 1313–1327 (2016)
Brešar, B., Klavžar, S., Rall, D.F., Wash, K.: Packing chromatic number under local changes in a graph. Discrete Math. (2016). doi:10.1016/j.disc.2016.09.030
Ekstein, J., Holub, P., Togni, O.: The packing coloring of distance graphs \(D(k, t)\). Discrete Appl. Math. 167, 100–106 (2014)
Fiala, J., Golovach, P.A.: Complexity of the packing coloring problem for trees. Discret. Appl. Math. 158, 771–778 (2010)
Fiala, J., Klavžar, S., Lidický, B.: The packing chromatic number of infinite product graphs. Eur. J. Comb. 30, 1101–1113 (2009)
Finbow, A., Rall, D.F.: On the packing chromatic number of some lattices. Discret. Appl. Math. 158, 1224–1228 (2010)
Gastineau, N.: Dichotomies properties on computational complexity of S-packing coloring problems. Discret. Math. 338, 1029–1041 (2015)
Gastineau, N., Kheddouci, H., Togni, O.: Subdivision into \(i\)-packing and \(S\)-packing chromatic number of some lattices. Ars Math. Contemp. 9, 331–354 (2015)
Gastineau, N., Togni, O.: \(S\)-packing colorings of cubic graphs. Discret. Math. 339, 2461–2470 (2016)
Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Harris, J.M., Rall, D.F.: Broadcast chromatic numbers of graphs. Ars Comb. 86, 33–49 (2008)
Goddard, W., Henning, M.A.: A characterization of cubic graphs with paired-domination number three-fifths their order. Graphs Comb. 25, 675–692 (2009)
Goddard, W., Xu, H.: The \(S\)-packing chromatic number of a graph. Discuss. Math. Graph Theory 32, 795–806 (2012)
Goddard, W., Xu, H.: A note on \(S\)-packing colorings of lattices. Discret. Appl. Math. 166, 255–262 (2014)
Jacobs, Y., Jonck, E., Joubert, E.J.: A lower bound for the packing chromatic number of the Cartesian product of cycles. Cent. Eur. J. Math. 11, 1344–1357 (2013)
Korže, D., Vesel, A.: On the packing chromatic number of square and hexagonal lattice. Ars Math. Contemp. 7, 13–22 (2014)
Laïche, D., Bouchemakh, I., Sopena, E.: On the packing coloring of undirected and oriented generalized theta graphs. Australas. J. Comb. 66, 310–329 (2016)
Petersen, J.: Die Theorie der regulären Graphen. Acta Math. 15, 193–220 (1891)
Shao, Z., Vesel, A.: Modeling the packing coloring problem of graphs. Appl. Math. Model. 39, 3588–3595 (2015)
Sloper, C.: An eccentric coloring of trees. Australas. J. Combin. 29, 309–321 (2004)
Togni, O.: On packing colorings of distance graphs. Discrete Appl. Math. 167, 280–289 (2014)
Torres, P., Valencia-Pabon, M.: The packing chromatic number of hypercubes. Discrete Appl. Math. 190–191, 127–140 (2015)
Torri, D., Zagaglia, N., Salvi, : New characterizations of the Petersen graph. Bull. Inst. Comb. Appl. 19, 79–82 (1997)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Brešar, B., Klavžar, S., Rall, D.F. et al. Packing chromatic number, \(\mathbf (1, 1, 2, 2) \)-colorings, and characterizing the Petersen graph. Aequat. Math. 91, 169–184 (2017). https://doi.org/10.1007/s00010-016-0461-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00010-016-0461-8