Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract). - Daniel Král; Pavel Nejedlý (MFCS, 2004)

Choosability of graphs with infinite sets of forbidden differences. - Pavel Nejedlý (Discret. Math., 2007)

Distance Constrained Labelings of K4-minor Free Graphs. - Daniel Král; Pavel Nejedlý (Electron. Notes Discret. Math., 2007)

Coloring squares of planar graphs with girth six. - Zdenek Dvorák 001; Daniel Král; Pavel Nejedlý; Riste Skrekovski (Eur. J. Comb., 2008)

Distance constrained labelings of planar graphs with no short cycles. - Zdenek Dvorák 001; Daniel Král; Pavel Nejedlý; Riste Skrekovski (Discret. Appl. Math., 2009)

Short Cycle Covers of Graphs with Minimum Degree Three. - Tomás Kaiser; Daniel Král'; Bernard Lidický; Pavel Nejedlý; Robert Sámal (SIAM J. Discret. Math., 2010)