Borut Luzar

According to our database1, Borut Luzar authored at least 36 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
The Bologna reform's impacts on the scientific publication performance of Ph.D. graduates - the case of Slovenia.
Scientometrics, 2020

Adynamic coloring of graphs.
Discret. Appl. Math., 2020

On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}.
Discret. Appl. Math., 2020

Between Proper and Strong Edge-Colorings of Subcubic Graphs.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
Note on list star edge-coloring of subcubic graphs.
J. Graph Theory, 2019

Note on 3-choosability of planar graphs with maximum degree 4.
Discret. Math., 2019

BiqBin: Moving Boundaries for NP-hard Problems by HPC.
Proceedings of the Advances in High Performance Computing, 2019

2018
Is science driven by principal investigators?
Scientometrics, 2018

New bounds for locally irregular chromatic index of bipartite and subcubic graphs.
J. Comb. Optim., 2018

On vertex-parity edge-colorings.
J. Comb. Optim., 2018

On facial unique-maximum (edge-)coloring.
Discret. Appl. Math., 2018

On Repetition Thresholds of Caterpillars and Trees of Bounded Degree.
Electron. J. Comb., 2018

2017
Analysis of Slovenian research community through bibliographic networks.
Scientometrics, 2017

Note on incidence chromatic number of subquartic graphs.
J. Comb. Optim., 2017

On a star chromatic index of subcubic graphs.
Electron. Notes Discret. Math., 2017

From NMNR-coloring of hypergraphs to homogenous coloring of graphs.
Ars Math. Contemp., 2017

On the difference between the Szeged and the Wiener index.
Appl. Math. Comput., 2017

2016
Core-periphery dynamics in collaboration networks: the case study of Slovenia.
Scientometrics, 2016

Star Edge Coloring of Some Classes of Graphs.
J. Graph Theory, 2016

On incidence coloring conjecture in Cartesian products of graphs.
Discret. Appl. Math., 2016

2015
l-facial edge colorings of graphs.
Discret. Appl. Math., 2015

Sandwiching the (generalized) Randić index.
Discret. Appl. Math., 2015

On a Generalization of Thue Sequences.
Electron. J. Comb., 2015

Counterexamples to a conjecture on injective colorings.
Ars Math. Contemp., 2015

Odd edge coloring of graphs.
Ars Math. Contemp., 2015

2014
Note on coloring of double disk graphs.
J. Glob. Optim., 2014

Strong edge-coloring of planar graphs.
Discret. Math., 2014

Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network.
CoRR, 2014

2013
Improved bound on facial parity edge coloring.
Discret. Math., 2013

2012
Extending Fractional Precolorings.
SIAM J. Discret. Math., 2012

A Planar linear arboricity conjecture.
J. Graph Theory, 2012

Acyclic edge coloring of planar graphs with Δ colors.
Discret. Appl. Math., 2012

Some remarks on inverse Wiener index problem.
Discret. Appl. Math., 2012

2010
An improved bound on the largest induced forests for triangle-free planar graphs.
Discret. Math. Theor. Comput. Sci., 2010

A Planar Linear Arboricity Conjecture.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Injective colorings of planar graphs with few colors.
Discret. Math., 2009


  Loading...