Funder
National Science Foundation
University of Illinois at Urbana-Champaign
Russian Foundation for Basic Research
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference23 articles.
1. Argiroffo, G., Nasini, G., Torres, P.: The packing coloring problem for lobsters and partner limited graphs. Discrete Appl. Math. 164, 373–382 (2014)
2. Balogh, J., Kostochka, A., Liu, X.: Packing chromatic number of cubic graphs. Discrete Math. 341, 474–483 (2018)
3. Brešar, B., Ferme, J.: An infinite family of subcubic graphs with unbounded packing chromatic number. Discrete Math. 341, 2337–2342 (2018)
4. 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, 2302–2311 (2007)
5. Brešar, B., Klavžar, S., Rall, D.F.: Packing chromatic number of base-3 Sierpiński graphs. Graphs Combin. 32, 1313–1327 (2016)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献