Injective colorings of planar graphs with few colors. - Borut Luzar; Riste Skrekovski; Martin Tancer (Discret. Math., 2009)

A Planar Linear Arboricity Conjecture. - Marek Cygan; Lukasz Kowalik; Borut Luzar (CIAC, 2010)

An improved bound on the largest induced forests for triangle-free planar graphs. - Lukasz Kowalik; Borut Luzar; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2010)

Some remarks on inverse Wiener index problem. - Jirí Fink; Borut Luzar; Riste Skrekovski (Discret. Appl. Math., 2012)

Acyclic edge coloring of planar graphs with Δ colors. - Dávid Hudák; Frantisek Kardos; Borut Luzar; Roman Soták; Riste Skrekovski (Discret. Appl. Math., 2012)

A Planar linear arboricity conjecture. - Marek Cygan; Jianfeng Hou; Lukasz Kowalik; Borut Luzar; Jian-Liang Wu 001 (J. Graph Theory, 2012)

Extending Fractional Precolorings. - Daniel Král'; Matjaz Krnc; Martin Kupec; Borut Luzar; Jan Volec (SIAM J. Discret. Math., 2012)

Improved bound on facial parity edge coloring. - Borut Luzar; Riste Skrekovski (Discret. Math., 2013)

Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network. - Borut Luzar; Zoran Levnajic; Janez Povh; Matjaz Perc (CoRR, 2014)

Strong edge-coloring of planar graphs. - Dávid Hudák; Borut Luzar; Roman Soták; Riste Skrekovski (Discret. Math., 2014)

Note on coloring of double disk graphs. - Jaka Kranjc; Borut Luzar; Martina Mockovciaková; Roman Soták (J. Glob. Optim., 2014)

Odd edge coloring of graphs. - Borut Luzar; Mirko Petrusevski; Riste Skrekovski (Ars Math. Contemp., 2015)

Counterexamples to a conjecture on injective colorings. - Borut Luzar; Riste Skrekovski (Ars Math. Contemp., 2015)

On a Generalization of Thue Sequences. - Jaka Kranjc; Borut Luzar; Martina Mockovciaková; Roman Soták (Electron. J. Comb., 2015)

Sandwiching the (generalized) Randić index. - Martin Knor; Borut Luzar; Riste Skrekovski (Discret. Appl. Math., 2015)

l-facial edge colorings of graphs. - Borut Luzar; Martina Mockovciaková; Roman Soták; Riste Skrekovski; Peter Sugerek (Discret. Appl. Math., 2015)

On incidence coloring conjecture in Cartesian products of graphs. - Petr Gregor; Borut Luzar; Roman Soták (Discret. Appl. Math., 2016)

Star Edge Coloring of Some Classes of Graphs. - L'udmila Bezegová; Borut Luzar; Martina Mockovciaková; Roman Soták; Riste Skrekovski (J. Graph Theory, 2016)

Core-periphery dynamics in collaboration networks: the case study of Slovenia. - Mario Karlovcec; Borut Luzar; Dunja Mladenic (Scientometrics, 2016)

On the difference between the Szeged and the Wiener index. - Marthe Bonamy; Martin Knor; Borut Luzar; Alexandre Pinlou; Riste Skrekovski (Appl. Math. Comput., 2017)

From NMNR-coloring of hypergraphs to homogenous coloring of graphs. - Mária Janicová; Tomás Madaras; Roman Soták; Borut Luzar (Ars Math. Contemp., 2017)

On a star chromatic index of subcubic graphs. - Borut Luzar; Martina Mockovciaková; Roman Soták (Electron. Notes Discret. Math., 2017)

Note on incidence chromatic number of subquartic graphs. - Petr Gregor; Borut Luzar; Roman Soták (J. Comb. Optim., 2017)

Analysis of Slovenian research community through bibliographic networks. - Andrej Kastrin; Jelena Klisara; Borut Luzar; Janez Povh (Scientometrics, 2017)

On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. - Borut Luzar; Pascal Ochem; Alexandre Pinlou (Electron. J. Comb., 2018)

On facial unique-maximum (edge-)coloring. - Vesna Andova; Bernard Lidický; Borut Luzar; Riste Skrekovski (Discret. Appl. Math., 2018)

On vertex-parity edge-colorings. - Borut Luzar; Mirko Petrusevski; Riste Skrekovski (J. Comb. Optim., 2018)

New bounds for locally irregular chromatic index of bipartite and subcubic graphs. - Borut Luzar; Jakub Przybylo; Roman Soták (J. Comb. Optim., 2018)

Is science driven by principal investigators? - Andrej Kastrin; Jelena Klisara; Borut Luzar; Janez Povh (Scientometrics, 2018)

BiqBin: Moving Boundaries for NP-hard Problems by HPC. - Timotej Hrga; Borut Luzar; Janez Povh; Angelika Wiegele (HPC, 2019)

Note on 3-choosability of planar graphs with maximum degree 4. - François Dross; Borut Luzar; Mária Maceková; Roman Soták (Discret. Math., 2019)

Note on list star edge-coloring of subcubic graphs. - Borut Luzar; Martina Mockovciaková; Roman Soták (J. Graph Theory, 2019)

On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. - Borut Luzar; Martina Mockovciaková; Pascal Ochem; Alexandre Pinlou; Roman Soták (Discret. Appl. Math., 2020)

Adynamic coloring of graphs. - Mária Surimová; Borut Luzar; Tomás Madaras (Discret. Appl. Math., 2020)

The Bologna reform's impacts on the scientific publication performance of Ph.D. graduates - the case of Slovenia. - Katarina Rojko; Brankica Bratic; Borut Luzar (Scientometrics, 2020)

Star edge-coloring of square grids. - Premysl Holub; Borut Luzar; Erika Mihaliková; Martina Mockovciaková; Roman Soták (Appl. Math. Comput., 2021)

The Dudeney-Stockmeyer Conjecture. - Andreas M. Hinz; Borut Luzar; Ciril Petr (Discret. Appl. Math., 2022)

Further extensions of the Grötzsch Theorem. - Hoang La; Borut Luzar; Kenny Storgel (Discret. Math., 2022)

Between proper and strong edge-colorings of subcubic graphs. - Hervé Hocquard; Dimitri Lajou; Borut Luzar (J. Graph Theory, 2022)

Strong edge colorings of graphs and the covers of Kneser graphs. - Borut Luzar; Edita Mácajová; Martin Skoviera; Roman Soták (J. Graph Theory, 2022)

Scientific performance across research disciplines: Trends and differences in the case of Slovenia. - Katarina Rojko; Borut Luzar (J. Informetrics, 2022)

BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints. - Nicolò Gusmeroli; Timotej Hrga; Borut Luzar; Janez Povh; Melanie Siebenhofer; Angelika Wiegele (ACM Trans. Math. Softw., 2022)

Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. - Igor Fabrici; Borut Luzar; Simona Rindosová; Roman Soták (Discret. Appl. Math., 2023)

Structure of university licensing networks. - Dolores Modic; Borut Luzar; Tohru Yoshioka-Kobayashi (Scientometrics, 2023)

3-facial edge-coloring of plane graphs. - Mirko Hornák; Borut Luzar; Kenny Storgel (Discret. Math., 2023)

Locally irregular edge-coloring of subcubic graphs. - Borut Luzar; Mária Maceková; Simona Rindosová; Roman Soták; Katarína Sroková; Kenny Storgel (Discret. Appl. Math., 2023)

List strong and list normal edge-coloring of (sub)cubic graphs. - Borut Luzar; Edita Mácajová; Roman Soták; Diana Svecová (CoRR, 2024)

Packing coloring of hypercubes with extended Hamming codes. - Petr Gregor; Jaka Kranjc; Borut Luzar; Kenny Storgel (Discret. Appl. Math., 2024)

Revisiting semistrong edge-coloring of graphs. - Borut Luzar; Martina Mockovciaková; Roman Soták (J. Graph Theory, 2024)

Degree-balanced decompositions of cubic graphs. - Borut Luzar; Jakub Przybylo; Roman Soták (Eur. J. Comb., 2025)