Holub, Přemysl

1. The packing chromatic number of the square lattice is at least 12
   2010/03/11 by Ekstein, Jan, Fiala, Jiří, Holub, Přemysl +1 · 1 citation
   #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.2
2. S-packing chromatic vertex-critical graphs
   2020/01/25 by Holub, Přemysl, Jakovac, Marko, Klavžar, Sandi · 2 citations
   #Combinatorics (math.CO) #FOS: Mathematics
3. On forbidden induced subgraphs for K_1,3-free perfect graphs
   2019/03/22 by Brause, Christoph, Holub, Přemysl, Kabela, Adam +3 · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
4. S-packing colorings of distance graphs with distance sets of cardinality 2
   2024/05/29 by Boštjan Brešar, Jasmina Ferme, Brešar, Boštjan +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
5. Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
   2021/02/17 by Brause, Christoph, Doan, Trung Duy, Holub, Přemysl +4 · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics