Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice. - Daniel Král; Petr Skoda 002 (SIAM J. Discret. Math., 2008)

An improved linear bound on the number of perfect matchings in cubic graphs. - Louis Esperet; Daniel Král'; Petr Skoda 002; Riste Skrekovski (Eur. J. Comb., 2010)

On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph. - Bojan Mohar; Petr Skoda 002 (IWOCA, 2011)

Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph. - Bojan Mohar; Petr Skoda 002 (J. Graph Algorithms Appl., 2012)

Domination number of cubic graphs with large girth. - Daniel Král'; Petr Skoda 002; Jan Volec (J. Graph Theory, 2012)

Computability of width of submodular partition functions. - Petr Skoda 002 (Eur. J. Comb., 2013)

Obstructions for two-vertex alternating embeddings of graphs in surfaces. - Bojan Mohar; Petr Skoda 002 (Eur. J. Comb., 2017)

Excluded minors for the Klein bottle II. Cascades. - Bojan Mohar; Petr Skoda 002 (J. Comb. Theory B, 2024)

Excluded minors for the Klein bottle I. Low connectivity case. - Bojan Mohar; Petr Skoda 002 (J. Comb. Theory B, 2024)