The following pages link to Michal Kotrbčík (Q413260):
Displayed 16 items.
- A note on disjoint cycles (Q413261) (← links)
- Matchings, cycle bases, and the maximum genus of a graph (Q456321) (← links)
- Genus of the Cartesian product of triangles (Q888606) (← links)
- Online dominating set (Q1741855) (← links)
- Edge-Editing to a Dense and a Sparse Graph Class (Q2802969) (← links)
- (Q2857401) (← links)
- Genus Distributions of cubic series-parallel graphs (Q2928586) (← links)
- Equimatchable Graphs on Surfaces (Q3466352) (← links)
- Maximum genus, connectivity, and Nebeský's Theorem (Q3466844) (← links)
- Grünbaum colorings of even triangulations on surfaces (Q4638641) (← links)
- Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings (Q5232735) (← links)
- Online Dominating Set (Q5369523) (← links)
- (Q5419968) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)
- Simple greedy 2-approximation algorithm for the maximum genus of a graph (Q6258603) (← links)
- Equimatchable factor-critical graphs and independence number 2 (Q6258614) (← links)