Premysl Holub

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