Drago Bokal

Orcid: 0000-0003-1196-5476

According to our database1, Drago Bokal authored at least 30 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Graph drawing applications in combinatorial theory of maturity models.
CoRR, 2024

2022
The connectivity of the dual.
J. Graph Theory, 2022

Properties of Large 2-Crossing-Critical Graphs.
J. Graph Algorithms Appl., 2022

Guarding a subgraph as a tool in pursuit-evasion games.
Discuss. Math. Graph Theory, 2022

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12.
Comb., 2022

2021
Principal/Two-Agent model with internal signal.
Central Eur. J. Oper. Res., 2021

2019
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12.
CoRR, 2019

On Degree Properties of Crossing-Critical Families of Graphs.
Electron. J. Comb., 2019

Phases of psychologically optimal learning experience: task-based time allocation model.
Central Eur. J. Oper. Res., 2019

2018
Characterizing all graphs with 2-exceptional edges.
Ars Math. Contemp., 2018

2017
Dan Archdeacon (11 May 1954 to 18 February 2015).
Ars Math. Contemp., 2017

A characterization of plane Gauss paragraphs.
Ars Math. Contemp., 2017

2016
Characterizing 2-crossing-critical graphs.
Adv. Appl. Math., 2016

2015
Finding All Maximal Subsequences with Hereditary Properties.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2013
Crossing number additivity over edge cuts.
Eur. J. Comb., 2013

2012
A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks.
Discret. Appl. Math., 2012

Open and Scalable IoT Platform and Its Applications for Real Time Access Line Monitoring and Alarm Correlation.
Proceedings of the Internet of Things, Smart Spaces, and Next Generation Networking, 2012

2011
Computing quadratic entropy in evolutionary trees.
Comput. Math. Appl., 2011

2010
Infinite families of crossing-critical graphs with prescribed average degree and crossing number.
J. Graph Theory, 2010

General Lower Bounds for the Minor Crossing Number of Graphs.
Discret. Comput. Geom., 2010

On the Sharpness of Some Results Relating Cuts and Crossing Numbers.
Electron. J. Comb., 2010

2008
The Minor Crossing Number of Graphs with an Excluded Minor.
Electron. J. Comb., 2008

2007
On the crossing numbers of Cartesian products with trees.
J. Graph Theory, 2007

On the crossing numbers of Cartesian products with paths.
J. Comb. Theory B, 2007

Graph minors and the crossing number of graphs.
Electron. Notes Discret. Math., 2007

2006
The Minor Crossing Number.
SIAM J. Discret. Math., 2006

2005
Chromatic-index-critical graphs of orders 13 and 14.
Discret. Math., 2005

2004
The circular chromatic number of a digraph.
J. Graph Theory, 2004

A Spectral Approach to Graphical Representation of Data.
Informatica (Slovenia), 2004

1997
Isoperimetric Quotient for Fullerenes and Other Polyhedral Cages.
J. Chem. Inf. Comput. Sci., 1997


  Loading...