The following pages link to Martin Škoviera (Q166312):
Displaying 6 items.
- Decycling cubic graphs (Q6451967) (← links)
- NP-completeness of perfect matching index of cubic graphs (Q6491002) (← links)
- An 8-flow theorem for signed graphs (Q6522600) (← links)
- Simple greedy 2-approximation algorithm for the maximum genus of a graph (Q6593569) (← links)
- Permutation snarks of order \(2 \pmod{8}\) (Q6621242) (← links)
- Strictly critical snarks with girth or cyclic connectivity equal to 6 (Q6733825) (← links)