## Theses

## Publications

- B. Mohar and P. Škoda.
Cascades and obstructions of low connectivity for embedding graphs into the Klein bottle.
Submitted to JCTB, June 2014. arXiv: 1406.1341
- B. Mohar and P. Škoda.
Obstructions of connectivity two for embedding graphs into the torus.
Canad. J. Math. 66 (2014) 1327-1357.
- P. Škoda.
Computability of Width of Submodular Partition Functions.
Eur. J. Comb. 34(3): 660-665 (2013).
- B. Mohar and P. Škoda.
Minimizing the number of label transitions around a nonseparating vertex of a planar graph.
J. Graph Algorithms Appl., 16:225-241, 2012.
- D. Král', P. Škoda, J. Volec.
Domination number of cubic graphs with large girth,
J. Graph Theory, 69(2):131-142, 2012.
- B. Mohar and P. Škoda.
Obstructions for two-vertex alternating embeddings of graphs in surfaces.
ArXiv e-prints, 2011, arXiv:1112.0800.
- L. Esperet, D. Král', P. Škoda, R. Škrekovski.
An improved linear bound on the number of perfect matchings in cubic graphs.
Eur. J. Comb. 31, 5 (July 2010), 1316-1334.
- D. Král', P. Škoda.
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice.
SIAM Journal on Discrete Mathematics 22(4) (2008), 1559-1569.