Borut Lužar

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2020

Star Edge-Coloring of Square Grids

Přemysl Holub, Borut Lužar, Erika Mihaliková +2

A star edge-coloring of a graph $G$ is a proper edge-coloring without bichromatic paths or cycles of length four. The smallest integer $k$ such that $G$ admits a star edge-coloring…

math.CO2018

On non-repetitive sequences of arithmetic progressions:the cases $k \in {4, 5, 6, 7, 8}$

Borut Lužar, Martina Mockovčiaková, Pascal Ochem +2

A $d$ -subsequence of a sequence $φ = x_{1} \dots x_{n}$ is a subsequence $x_{i} x_{i + d} x_{i + 2 d} \dots$ , for any positive integer $d$ and any $i$ , $1 \leq i \leq n$ . A \textit{ $k$ -Thue seque…

math.CO2018

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 $4$ ) is $3$ -colorable is NP-complete. Determining subclasses of planar graphs being $3$ -colorable has a long history, but si…

Star Edge-Coloring of Square Grids

On non-repetitive sequences of arithmetic progressions:the cases k∈{4,5,6,7,8}

Note on 3-Choosability of Planar Graphs with Maximum Degree 4

On non-repetitive sequences of arithmetic progressions:the cases $k \in {4, 5, 6, 7, 8}$