3 citations · 8 across the 9 of their papers we have counts for
8 papers · 1 filter
The Connectivity of the Dual
Drago Bokal, Gunnar Brinkmannb, Carol T. Zamfirescu
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficientl…
On Degree Properties of Crossing-Critical Families of Graphs
Drago Bokal, Mojca Bračič, Marek Derňár +1
Answering an open question from 2007, we construct infinite -crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~…
An algebraic approach to enumerating non-equivalent double traces in graphs
Nino Bašić, Drago Bokal, Tomas Boothby +1
Recently designed biomolecular approaches to build single chain polypeptide polyhedra as molecular origami nanostructures have risen high interest in various double traces of the u…
Characterizing 2-crossing-critical graphs
Drago Bokal, Bogdan Oporowski, R. Bruce Richter +1
It is very well-known that there are precisely two minimal non-planar graphs: and (degree 2 vertices being irrelevant in this context). In the language of crossing…
Minor crossing number is additive over arbitrary cuts
Drago Bokal, Markus Chimani, Jesús Leaños
We prove that if is a graph with an minimal edge cut of size three and , are the two (augmented) components of , then the crossing number of is equal to…
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…