3 citations · 8 across the 9 of their papers we have counts for
11 papers
Graph drawing applications in combinatorial theory of maturity models
Špela Kajzer, Alexander Dobler, Janja Jerebic +3
In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hyper…
Properties of Large 2-Crossing-Critical Graphs
Drago Bokal, Markus Chimani, Alexander Nover +4
A -crossing-critical graph is one that has crossing number at least but each of its proper subgraphs has crossing number less than . Recently, a set of explicit construct…
Bounded maximum degree conjecture holds precisely for -crossing-critical graphs with
Drago Bokal, Zdeněk Dvořák, Petr Hliněný +3
We study -crossing-critical graphs, which are the minimal graphs that require at least edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13…
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…