3 citations · 4 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2009★ 1 cited
A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
D. Bokal, B. Bresar, J. Jerebic
In this paper, we consider various problems concerning quasi-matchings and semi-matchings in bipartite graphs, which generalize the classical problem of determining a perfect match…
math.CO2009
Infinite families of crossing-critical graphs with prescribed average degree and crossing number
Drago Bokal
Siran constructed infinite families of k-crossing-critical graphs for every k=>3 and Kochol constructed such families of simple graphs for every k=>2. Richter and Thomassen argued…
math.CO2006★ 3 cited
The Minor Crossing Number of Graphs with an Excluded Minor
Drago Bokal, Gašper Fijavž, David R. Wood
The "minor crossing number" of a graph is the minimum crossing number of a graph that contains as a minor. It is proved that for every graph there is a constant , su…