4 papers
Star Edge-Coloring of Square Grids
Přemysl Holub, Borut Lužar, Erika Mihaliková +2
A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths or cycles of length four. The smallest integer such that admits a star edge-coloring…
On non-repetitive sequences of arithmetic progressions:the cases
Borut Lužar, Martina Mockovčiaková, Pascal Ochem +2
A -subsequence of a sequence is a subsequence , for any positive integer and any , . A \textit{-Thue seque…
Note on 3-Choosability of Planar Graphs with Maximum Degree 4
François Dross, Borut Lužar, Mária Maceková +1
Deciding whether a planar graph (even of maximum degree ) is -colorable is NP-complete. Determining subclasses of planar graphs being -colorable has a long history, but si…
Is science driven by principal investigators?
Andrej Kastrin, Jelena Klisara, Borut Lužar +1
In this paper we consider the scientific and career performance of principal investigators (PI's) of publicly funded research projects compared to scientific performance of all res…