Premysl Holub

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 11

Top Topics

Subgraph Matching

Maximum Common Subgraph

Connected Graphs

Top Venues

Discret. Appl. Math.

Appl. Math. Comput.

Publications

Premysl Holub, Jakub Hofman
On S-packing colourings of distance graphs D(1,t) and D(1,2,t). Appl. Math. Comput. 447 (2023)
Premysl Holub, Zdenek Ryjácek, Petr Vrána, Shipeng Wang, Liming Xiong
Forbidden pairs of disconnected graphs for 2-factor of connected graphs. J. Graph Theory 100 (2) (2022)
Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. Discret. Math. 345 (6) (2022)
Premysl Holub, Borut Luzar, Erika Mihaliková, Martina Mockovciaková, Roman Soták
Star edge-coloring of square grids. Appl. Math. Comput. 392 (2021)
Premysl Holub, Marko Jakovac, Sandi Klavzar
S-packing chromatic vertex-critical graphs. Discret. Appl. Math. 285 (2020)
Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
On forbidden induced subgraphs for K1, 3-free perfect graphs. Discret. Math. 342 (6) (2019)
Nicolas Gastineau, Premysl Holub, Olivier Togni
On the packing chromatic number of subcubic outerplanar graphs. Discret. Appl. Math. 255 (2019)
Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický
3-coloring triangle-free planar graphs with a precolored 9-cycle. Eur. J. Comb. 68 (2018)
Nicolas Gastineau, Premysl Holub, Olivier Togni
On packing chromatic number of subcubic outerplanar graphs. CoRR (2017)
Jan Brousek, Premysl Holub, Zdenek Ryjácek, Petr Vrána
Finite families of forbidden subgraphs for rainbow connection in graphs. Discret. Math. 339 (9) (2016)
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. Discret. Math. 339 (2) (2016)
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
Rainbow connection and forbidden subgraphs. Discret. Math. 338 (10) (2015)
Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus
-free graphs. Electron. Notes Discret. Math. 49 (2015)
Premysl Holub, Joe Ryan
Degree diameter problem on triangular networks. Australas. J Comb. 63 (2015)
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer
On forbidden subgraphs and rainbow connection in graphs with minimum degree 2. Discret. Math. 338 (3) (2015)
Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle. IWOCA (2014)
Jan Ekstein, Premysl Holub, Olivier Togni
The packing coloring of distance graphs D(k, t). Discret. Appl. Math. 167 (2014)
Premysl Holub, Mirka Miller, Hebert Pérez-Rosés, Joe Ryan
Degree diameter problem on honeycomb networks. Discret. Appl. Math. 179 (2014)
Premysl Holub
Forbidden subgraphs and the hamiltonian index of a 2-connected graph. Ars Comb. 117 (2014)
Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer
The rainbow connection number of 2-connected graphs. Discret. Math. 313 (19) (2013)
Roman Cada, Jan Ekstein, Premysl Holub, Olivier Togni
Radio labelings of distance graphs. Discret. Appl. Math. 161 (18) (2013)
Premysl Holub
The edge-closure of a claw-free graph is the line graph of a multigraph. Ars Comb. 106 (2012)
Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang
Star subdivisions and connected even factors in the square of a graph. Discret. Math. 312 (17) (2012)
Jan Ekstein, Premysl Holub, Bernard Lidický
Packing chromatic number of distance graphs. Discret. Appl. Math. 160 (4-5) (2012)
Jan Ekstein, Premysl Holub, Bernard Lidický
Packing Chromatic Number of Distance Graphs CoRR (2011)
Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický
The packing chromatic number of the square lattice is at least 12 CoRR (2010)
Jan Brousek, Premysl Holub
The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs. Discret. Math. 310 (13-14) (2010)
Roman Soukal, Premysl Holub
A Note on Packing Chromatic Number of the Square Lattice. Electron. J. Comb. 17 (1) (2010)
Premysl Holub, Liming Xiong
On distance local connectivity and the hamiltonian index. Discret. Math. 309 (9) (2009)
Premysl Holub
On distance local connectivity and vertex distance colouring. Discuss. Math. Graph Theory 27 (2) (2007)