Přemysl Holub

1. The packing chromatic number of the square lattice is at least 12
   2010/03/11 by Jan Ekstein, Jiří Fiala, Ekstein, Jan +5 · 1 citation
   Computer Science · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.2 #cs.DM
2. On forbidden induced subgraphs for K_1,3-free perfect graphs
   2019/03/22 by Christoph Brause, Přemysl Holub, Brause, Christoph +9 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
3. S-packing colorings of distance graphs with distance sets of cardinality 2
   2024/05/29 by Boštjan Brešar, Brešar, Boštjan, Jasmina Ferme +7 · 2 citations
   Computer Science · Engineering · #05C12 #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems