default search action
Borut Luzar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j45]Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel:
Packing coloring of hypercubes with extended Hamming codes. Discret. Appl. Math. 359: 269-277 (2024) - [j44]Borut Luzar
, Martina Mockovciaková, Roman Soták
Revisiting semistrong edge-coloring of graphs. J. Graph Theory 105(4): 612-632 (2024) - [i10]Borut Luzar, Jakub Przybylo, Roman Soták:
Degree-balanced decompositions of cubic graphs. CoRR abs/2408.16121 (2024) - [i9]Borut Luzar, Edita Mácajová, Roman Soták, Diana Svecová:
List strong and list normal edge-coloring of (sub)cubic graphs. CoRR abs/2410.01049 (2024) - 2023
- [j43]Igor Fabrici, Borut Luzar
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. Discret. Appl. Math. 324: 80-92 (2023) - [j42]Borut Luzar
Locally irregular edge-coloring of subcubic graphs. Discret. Appl. Math. 339: 136-148 (2023) - [j41]Mirko Hornák
3-facial edge-coloring of plane graphs. Discret. Math. 346(5): 113312 (2023) - [j40]Dolores Modic
Structure of university licensing networks. Scientometrics 128(2): 901-932 (2023) - [i8]Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel:
Packing coloring of hypercubes with extended Hamming codes. CoRR abs/2312.14576 (2023) - 2022
- [j39]Andreas M. Hinz
The Dudeney-Stockmeyer Conjecture. Discret. Appl. Math. 319: 19-26 (2022) - [j38]Hoang La, Borut Luzar
Further extensions of the Grötzsch Theorem. Discret. Math. 345(6): 112849 (2022) - [j37]Borut Luzar
Strong edge colorings of graphs and the covers of Kneser graphs. J. Graph Theory 100(4): 686-697 (2022) - [j36]Hervé Hocquard
Between proper and strong edge-colorings of subcubic graphs. J. Graph Theory 101(4): 686-716 (2022) - [j35]Katarina Rojko
Scientific performance across research disciplines: Trends and differences in the case of Slovenia. J. Informetrics 16(2): 101261 (2022) - [j34]Nicolò Gusmeroli
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints. ACM Trans. Math. Softw. 48(2): 15:1-15:31 (2022) - [i7]Igor Fabrici, Borut Luzar, Simona Rindosová, Roman Soták:
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. CoRR abs/2202.02570 (2022) - [i6]Borut Luzar, Martina Mockovciaková, Roman Soták:
Revisiting Semistrong Edge-Coloring of Graphs. CoRR abs/2208.13297 (2022) - [i5]Borut Luzar, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel:
Locally irregular edge-coloring of subcubic graphs. CoRR abs/2210.04649 (2022) - 2021
- [j33]Premysl Holub, Borut Luzar, Erika Mihaliková, Martina Mockovciaková, Roman Soták
Star edge-coloring of square grids. Appl. Math. Comput. 392: 125741 (2021) - 2020
- [j32]Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou
On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. Discret. Appl. Math. 279: 106-117 (2020) - [j31]Mária Surimová, Borut Luzar
Adynamic coloring of graphs. Discret. Appl. Math. 284: 224-233 (2020) - [j30]Katarina Rojko, Brankica Bratic, Borut Luzar:
The Bologna reform's impacts on the scientific publication performance of Ph.D. graduates - the case of Slovenia. Scientometrics 124(1): 329-356 (2020) - [c3]Hervé Hocquard, Dimitri Lajou, Borut Luzar:
Between Proper and Strong Edge-Colorings of Subcubic Graphs. IWOCA 2020: 355-367 - [i4]Hervé Hocquard, Dimitri Lajou, Borut Luzar:
Between proper and strong edge-colorings of subcubic graphs. CoRR abs/2011.02175 (2020)
2010 – 2019
- 2019
- [j29]François Dross, Borut Luzar
Note on 3-choosability of planar graphs with maximum degree 4. Discret. Math. 342(11): 3123-3129 (2019) - [j28]Borut Luzar
Note on list star edge-coloring of subcubic graphs. J. Graph Theory 90(3): 304-310 (2019) - [c2]Timotej Hrga, Borut Luzar, Janez Povh, Angelika Wiegele:
BiqBin: Moving Boundaries for NP-hard Problems by HPC. HPC 2019: 327-339 - 2018
- [j27]Borut Luzar, Pascal Ochem, Alexandre Pinlou:
On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. Electron. J. Comb. 25(1): 1 (2018) - [j26]Vesna Andova
On facial unique-maximum (edge-)coloring. Discret. Appl. Math. 237: 26-32 (2018) - [j25]Borut Luzar
On vertex-parity edge-colorings. J. Comb. Optim. 35(2): 373-388 (2018) - [j24]Borut Luzar
New bounds for locally irregular chromatic index of bipartite and subcubic graphs. J. Comb. Optim. 36(4): 1425-1438 (2018) - [j23]Andrej Kastrin
Is science driven by principal investigators? Scientometrics 117(2): 1157-1182 (2018) - [i3]Andrej Kastrin, Jelena Klisara, Borut Luzar, Janez Povh:
Is science driven by principal investigators? CoRR abs/1804.01062 (2018) - 2017
- [j22]Marthe Bonamy, Martin Knor, Borut Luzar
On the difference between the Szeged and the Wiener index. Appl. Math. Comput. 312: 202-213 (2017) - [j21]Mária Janicová, Tomás Madaras, Roman Soták, Borut Luzar:
From NMNR-coloring of hypergraphs to homogenous coloring of graphs. Ars Math. Contemp. 12(2): 351-360 (2017) - [j20]Borut Luzar
On a star chromatic index of subcubic graphs. Electron. Notes Discret. Math. 61: 835-839 (2017) - [j19]Petr Gregor
Note on incidence chromatic number of subquartic graphs. J. Comb. Optim. 34(1): 174-181 (2017) - [j18]Andrej Kastrin
Analysis of Slovenian research community through bibliographic networks. Scientometrics 110(2): 791-813 (2017) - [i2]Borut Luzar, Pascal Ochem, Alexandre Pinlou:
On repetition thresholds of caterpillars and trees of bounded degree. CoRR abs/1702.01058 (2017) - 2016
- [j17]Petr Gregor
On incidence coloring conjecture in Cartesian products of graphs. Discret. Appl. Math. 213: 93-100 (2016) - [j16]L'udmila Bezegová, Borut Luzar
Star Edge Coloring of Some Classes of Graphs. J. Graph Theory 81(1): 73-82 (2016) - [j15]Mario Karlovcec
Core-periphery dynamics in collaboration networks: the case study of Slovenia. Scientometrics 109(3): 1561-1578 (2016) - 2015
- [j14]Borut Luzar, Riste Skrekovski
Counterexamples to a conjecture on injective colorings. Ars Math. Contemp. 8(2): 291-295 (2015) - [j13]Borut Luzar, Mirko Petrusevski, Riste Skrekovski
Odd edge coloring of graphs. Ars Math. Contemp. 9(2): 267-277 (2015) - [j12]Jaka Kranjc, Borut Luzar, Martina Mockovciaková, Roman Soták:
On a Generalization of Thue Sequences. Electron. J. Comb. 22(2): 2 (2015) - [j11]Martin Knor, Borut Luzar
Sandwiching the (generalized) Randić index. Discret. Appl. Math. 181: 160-166 (2015) - [j10]Borut Luzar
l-facial edge colorings of graphs. Discret. Appl. Math. 181: 193-200 (2015) - 2014
- [j9]Dávid Hudák, Borut Luzar
Strong edge-coloring of planar graphs. Discret. Math. 324: 41-49 (2014) - [j8]Jaka Kranjc, Borut Luzar
Note on coloring of double disk graphs. J. Glob. Optim. 60(4): 793-799 (2014) - [i1]Borut Luzar, Zoran Levnajic, Janez Povh, Matjaz Perc:
Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network. CoRR abs/1407.1034 (2014) - 2013
- [j7]Borut Luzar
Improved bound on facial parity edge coloring. Discret. Math. 313(20): 2218-2222 (2013) - 2012
- [j6]Dávid Hudák, Frantisek Kardos, Borut Luzar
Acyclic edge coloring of planar graphs with Δ colors. Discret. Appl. Math. 160(9): 1356-1368 (2012) - [j5]Jirí Fink
Some remarks on inverse Wiener index problem. Discret. Appl. Math. 160(12): 1851-1858 (2012) - [j4]Marek Cygan
A Planar linear arboricity conjecture. J. Graph Theory 69(4): 403-425 (2012) - [j3]Daniel Král'
Extending Fractional Precolorings. SIAM J. Discret. Math. 26(2): 647-660 (2012) - 2010
- [j2]Lukasz Kowalik, Borut Luzar, Riste Skrekovski:
An improved bound on the largest induced forests for triangle-free planar graphs. Discret. Math. Theor. Comput. Sci. 12(1): 87-100 (2010) - [c1]Marek Cygan
A Planar Linear Arboricity Conjecture. CIAC 2010: 204-216
2000 – 2009
- 2009
- [j1]Borut Luzar
Injective colorings of planar graphs with few colors. Discret. Math. 309(18): 5636-5649 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: