×

Packing chromatic numbers of finite super subdivisions of graphs. (English) Zbl 1499.05222


MSC:

05C15 Coloring of graphs and hypergraphs
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C12 Distance in graphs

References:

[1] J. Balogh, A. Kostochka, X. Liu, Packing chromatic number of subcubic graphs, Discrete Mathematics 341 (2018) 474-483. · Zbl 1376.05047
[2] J. Balogh, A. Kostochka, X. Liu, Packing chromatic number of subdivisions of cubic graphs, Graphs and Combinatorics 35 (2019) 513-537. · Zbl 1409.05080
[3] M. Barnaby, F. Raimondi, T. Chen, J. Martin, The packing chromatic number of the infinite square lattice is between 13 and 15, Discrete Applied Mathematics 225 (2017) 136-142. · Zbl 1361.05051
[4] B. Breˇsar, J. Ferme, Packing coloring of Sierpi ˜nski-type graphs, Aequationes Mathematicae 92 (2018) 1091-1118. · Zbl 1400.05079
[5] B. Breˇsar, J. Ferme, An infinite family of subcubic graphs with unbounded packing chromatic number, Discrete Mathematics 341 (2018) 2337-2342. · Zbl 1388.05059
[6] B. Breˇsar, S. Klavˇzar, D.F. Rall, On the packing chromatic number of Cartesian products, hexagonal lattice and trees, Discrete Applied Mathematics 155 (2007) 2303-2311. · Zbl 1126.05045
[7] B. Breˇsar, S. Klavˇzar, D.F. Rall, K. Wash, Packing chromatic number under local changes in a graph, Discrete Mathematics 340 (2017) 1110-1115. · Zbl 1357.05037
[8] B. Breˇsar, S. Klavˇzar, D.F. Rall, K. Wash, Packing chromatic number, (1,1,2,2)-colorings and characterizing the Petersen graph, Aequationes Mathematicae 91 (2017) 169-184. · Zbl 1355.05194
[9] B. Breˇsar, S. Klavˇzar, D.F. Rall, K. Wash, Packing chromatic number versus chromatic and clique number, Aequationes Mathematicae 92 (2018) 497-513. · Zbl 1390.05186
[10] J. Ekstein, P. Holub, O. Togni, The packing coloring of distance graphsD(k,t), Discrete Applied Mathematics 167 (2014) 100-106. · Zbl 1284.05213
[11] J. Fiala, S. Klavar, B. Lidick ´y, The packing chromatic number of infinite product graphs, European Journal of Combinatorics 30 (2009) 1101-1113. · Zbl 1207.05165
[12] J. Fiala and P.A. Golovach, Complexity of the packing chromatic number for trees, Discrete Applied Mathematics 158 (2010) 771-778. · Zbl 1219.05185
[13] A. Finbow, D.F. Rall, On the packing chromatic number of some lattices, Discrete Applied Mathematics 158 (2010) 1224-1228. · Zbl 1221.05137
[14] N. Gastineau, O. Togni,S-packing colorings of cubic graphs, Discrete Mathematics 339 (2016) 2461-2470. · Zbl 1339.05134
[15] W. Goddard, S.M. Hedetniemi, S.T. Hedetniemi, J.M. Harris, D.F. Rall. Broadcast chromatic numbers of graphs, Ars Combinatoria 86 (2008) 33-49. · Zbl 1224.05172
[16] N. Gastineau, O. Togni, On the packing chromatic number of subcubic outerplanar graphs, Discrete Applied Mathematics 255 (2019) 209-221. · Zbl 1405.05060
[17] I. Gopalapillai, The spectrum of neighborhood corona of graphs, Kragujevac Journal of Mathematics 35 (2011) 493-500. · Zbl 1289.05283
[18] V. Kaladevi, P. Backialakshmi, Maximum Distance Matrix of Super Subdivision of Star Graph, Journal of Computer and Mathematical Sciences 2 (2011) 780-898.
[19] M. Kim, B. Lidick ´y, T.Masaøik, F. Pfender, Notes on complexity of packing coloring, Information Processing Letters 137 (2018) 6-10. · Zbl 1478.68247
[20] S. Klavˇzar, D.F. Rall, Packing chromatic vertex-critical graphs, Discrete Mathematics & Theoretical Computer Science 21 (2019) paper #8, 18 pages. · Zbl 1411.05091
[21] D. Korˇze, A. Vesel, On the packing chromatic number of square and hexagonal lattice, Ars Mathematica Contemporanea 7 (2014) 13-22. · Zbl 1302.05142
[22] D. Korˇze, A. Vesel, (d,n)-packing colorings of infinite lattices, Discrete Applied Mathematics 237 (2018) 97-108. · Zbl 1380.05071
[23] D. Korˇze, A. Vesel, Packing coloring of generalized Sierpi ˜nski graphs, Discrete Mathematics & Theoretical Computer Science 21 (2019) paper #7, 18 pages. · Zbl 1411.05092
[24] P. J. A. Maheswari, M. V. Laksmi, Vertex equitable labeling of super subdivision graphs, Scientific International 27 (2015) 1-3.
[25] A. Nagarajan, R. Vasuki, On the meanness of arbitrary path super subdivision of paths, The Australasian Journal of Combinatorics 51 (2011) 41-48. · Zbl 1233.05160
[26] D. La¨ıche, E. Sopena, Packing colouring of some classes of cubic graphs, The Australasian Journal of Combinatorics 72 (2018) 376-404. · Zbl 1405.05145
[27] A. William, S. Roy, Packing chromatic number of certain graphs, International Journal of Pure and Applied Mathematics 87 (2013) 731-739.
[28] A. William, S. Roy, Packing chromatic number of certain trees and cycle related graphs
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.