The following pages link to Drago Bokal (Q244508):
Displaying 17 items.
- (Q412340) (redirect page) (← links)
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks (Q412342) (← links)
- (Q589409) (redirect page) (← links)
- On the crossing numbers of Cartesian products with paths (Q875940) (← links)
- On the sharpness of some results relating cuts and crossing numbers (Q986698) (← links)
- The minor crossing number of graphs with an excluded minor (Q1010709) (← links)
- On degree properties of crossing-critical families of graphs (Q1733938) (← links)
- Evolutionarily distinctive species often capture more phylogenetic diversity than expected (Q1794355) (← links)
- Phases of psychologically optimal learning experience: task-based time allocation model (Q1999546) (← links)
- Principal/two-agent model with internal signal (Q2051180) (← links)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- (Q5088941) (← links)
- A characterization of plane Gauss paragraphs (Q5357286) (← links)
- Finding All Maximal Subsequences with Hereditary Properties (Q5368691) (← links)
- On the crossing numbers of Cartesian products with trees (Q5434260) (← links)
- The connectivity of the dual (Q6081584) (← links)
