26 citations · 179 across the 21 of their papers we have counts for
4 papers · 1 filter
Obstructions of Connectivity 2 for Embedding Graphs into the Torus
Bojan Mohar, Petr Škoda
The complete set of minimal obstructions for embedding graphs into the torus is still not determined. In this paper, we present all obstructions for the torus of connectivity 2. Fu…
Obstructions for two-vertex alternating embeddings of graphs in surfaces
Bojan Mohar, Petr Škoda
A class of graphs that lies strictly between the classes of graphs of genus (at most) and is studied. For a fixed orientable surface of genus , let be…
Domination number of cubic graphs with large girth
Daniel Kral, Petr Skoda, Jan Volec
We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n/g)<3n/10+O(n/g).
An improved linear bound on the number of perfect matchings in cubic graphs
Louis Esperet, Daniel Kral, Petr Skoda +1
We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dime…