On distance local connectivity and vertex distance colouring. - Premysl Holub (Discuss. Math. Graph Theory, 2007)

On distance local connectivity and the hamiltonian index. - Premysl Holub; Liming Xiong (Discret. Math., 2009)

A Note on Packing Chromatic Number of the Square Lattice. - Roman Soukal; Premysl Holub (Electron. J. Comb., 2010)

The packing chromatic number of the square lattice is at least 12 - Jan Ekstein; Jirí Fiala 001; Premysl Holub; Bernard Lidický (CoRR, 2010)

The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs. - Jan Brousek; Premysl Holub (Discret. Math., 2010)

The edge-closure of a claw-free graph is the line graph of a multigraph. - Premysl Holub (Ars Comb., 2012)

Packing chromatic number of distance graphs. - Jan Ekstein; Premysl Holub; Bernard Lidický (Discret. Appl. Math., 2012)

Star subdivisions and connected even factors in the square of a graph. - Jan Ekstein; Premysl Holub; Tomás Kaiser; Liming Xiong; Shenggui Zhang (Discret. Math., 2012)

Radio labelings of distance graphs. - Roman Cada; Jan Ekstein; Premysl Holub; Olivier Togni (Discret. Appl. Math., 2013)

The rainbow connection number of 2-connected graphs. - Jan Ekstein; Premysl Holub; Tomás Kaiser; Maria Koch; Stephan Matos Camacho; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2013)

Forbidden subgraphs and the hamiltonian index of a 2-connected graph. - Premysl Holub (Ars Comb., 2014)

The packing coloring of distance graphs D(k, t). - Jan Ekstein; Premysl Holub; Olivier Togni (Discret. Appl. Math., 2014)

Degree diameter problem on honeycomb networks. - Premysl Holub; Mirka Miller; Hebert Pérez-Rosés; Joe Ryan 001 (Discret. Appl. Math., 2014)

Degree diameter problem on triangular networks. - Premysl Holub; Joe Ryan 001 (Australas. J Comb., 2015)

On forbidden subgraphs and rainbow connection in graphs with minimum degree 2. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2015)

Rainbow connection and forbidden subgraphs. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2015)

4-colorability of P6-free graphs. - Christoph Brause; Ingo Schiermeyer; Premysl Holub; Zdenek Ryjácek; Petr Vrána; Rastislav Krivos-Bellus (Electron. Notes Discret. Math., 2015)

Finite families of forbidden subgraphs for rainbow connection in graphs. - Jan Brousek; Premysl Holub; Zdenek Ryjácek; Petr Vrána (Discret. Math., 2016)

Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2016)

3-coloring triangle-free planar graphs with a precolored 9-cycle. - Ilkyoo Choi; Jan Ekstein; Premysl Holub; Bernard Lidický (Eur. J. Comb., 2018)

On the packing chromatic number of subcubic outerplanar graphs. - Nicolas Gastineau; Premysl Holub; Olivier Togni (Discret. Appl. Math., 2019)

On forbidden induced subgraphs for K1, 3-free perfect graphs. - Christoph Brause; Premysl Holub; Adam Kabela; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2019)

S-packing chromatic vertex-critical graphs. - Premysl Holub; Marko Jakovac; Sandi Klavzar (Discret. Appl. Math., 2020)

Star edge-coloring of square grids. - Premysl Holub; Borut Luzar; Erika Mihaliková; Martina Mockovciaková; Roman Soták (Appl. Math. Comput., 2021)

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. - Christoph Brause; Trung Duy Doan; Premysl Holub; Adam Kabela; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2022)

Forbidden pairs of disconnected graphs for 2-factor of connected graphs. - Premysl Holub; Zdenek Ryjácek; Petr Vrána; Shipeng Wang; Liming Xiong (J. Graph Theory, 2022)

On S-packing colourings of distance graphs D(1,t) and D(1,2,t). - Premysl Holub; Jakub Hofman (Appl. Math. Comput., 2023)

S-packing colorings of distance graphs with distance sets of cardinality 2. - Bostjan Bresar; Jasmina Ferme; Premysl Holub; Marko Jakovac; Petra Melicharová (Appl. Math. Comput., 2025)