Person:244508: Difference between revisions

From MaRDI portal
Person:244508
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Drago Bokal to Drago Bokal: Duplicate
 
(No difference)

Latest revision as of 19:16, 9 December 2023

Available identifiers

zbMath Open bokal.dragoMaRDI QIDQ244508

List of research outcomes





PublicationDate of PublicationType
The connectivity of the dual2023-10-05Paper
Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)2023-01-23Paper
https://portal.mardi4nfdi.de/entity/Q50889412022-07-18Paper
Properties of Large 2-Crossing-Critical Graphs2022-06-28Paper
Guarding a subgraph as a tool in pursuit-evasion games2022-01-03Paper
Principal/two-agent model with internal signal2021-11-24Paper
An algebraic approach to enumerating non-equivalent double traces in graphs2021-10-15Paper
Counting Hamiltonian cycles in 2-tiled graphs2021-02-16Paper
Phases of psychologically optimal learning experience: task-based time allocation model2019-06-27Paper
Characterizing all graphs with 2-exceptional edges2019-03-27Paper
On degree properties of crossing-critical families of graphs2019-03-22Paper
Evolutionarily distinctive species often capture more phylogenetic diversity than expected2018-10-15Paper
Finding All Maximal Subsequences with Hereditary Properties2017-10-10Paper
A characterization of plane Gauss paragraphs2017-09-14Paper
On Degree Properties of Crossing-Critical Families of Graphs2017-02-10Paper
Characterizing 2-crossing-critical graphs2016-02-11Paper
https://portal.mardi4nfdi.de/entity/Q29439362015-09-07Paper
Crossing number additivity over edge cuts2014-04-11Paper
A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks2012-05-04Paper
Computing quadratic entropy in evolutionary trees2012-04-22Paper
Minor crossing number is additive over arbitrary cuts2011-11-25Paper
Infinite families of crossing-critical graphs with prescribed average degree and crossing number2010-11-10Paper
General lower bounds for the minor crossing number of graphs2010-09-22Paper
On the sharpness of some results relating cuts and crossing numbers2010-08-12Paper
https://portal.mardi4nfdi.de/entity/Q35766732010-07-30Paper
Technical details regarding infinite families of crossing-critical graphs with prescribed average degree and crossing number2009-09-10Paper
The minor crossing number of graphs with an excluded minor2009-04-07Paper
On the crossing numbers of Cartesian products with trees2008-01-04Paper
Graph minors and the crossing number of graphs2007-05-29Paper
The Minor Crossing Number2007-05-22Paper
On the crossing numbers of Cartesian products with paths2007-04-16Paper
Chromatic-index-critical graphs of orders 13 and 142005-10-26Paper
https://portal.mardi4nfdi.de/entity/Q54616042005-07-26Paper
The circular chromatic number of a digraph2004-08-04Paper

Research outcomes over time

This page was built for person: Drago Bokal