Higher Education Centre Novo Mesto

output

20132024

most citedForbidden branches in trees with minimal atom-bond connectivity index

28 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

8 papers · 1 filter

math.CO2024

List strong and list normal edge-coloring of (sub)cubic graphs

Borut Lužar, Edita Máčajová, Roman Soták +1

A strong edge-coloring of a graph is a proper edge-coloring, in which the edges of every path of length 3 receive distinct colors; in other words, every pair of edges at distance a…

math.CO2024

Degree-balanced decompositions of cubic graphs

Borut Lužar, Jakub Przybyło, Roman Soták

We show that every cubic graph on $n$ vertices contains a spanning subgraph in which the number of vertices of each degree deviates from $\frac{n}{4}$ by at most $\frac{1}{2}$ , up…

math.CO2023★ 2 cited

Packing coloring of hypercubes with extended Hamming codes

Petr Gregor, Jaka Kranjc, Borut Lužar +1

A {\em packing coloring} of a graph $G$ is a mapping assigning a positive integer (a color) to every vertex of $G$ such that every two vertices of color $k$ are at distance at leas…

math.CO2023★ 2 cited

Normal 5-edge-coloring of some snarks superpositioned by Flower snarks

Jelena Sedlar, Riste Škrekovski

An edge e is normal in a proper edge-coloring of a cubic graph G if the number of distinct colors on four edges incident to e is 2 or 4: A normal edge-coloring of G is a proper edg…

math.CO2022★ 5 cited

Revisiting Semistrong Edge-Coloring of Graphs

Borut Lužar, Martina Mockovčiaková, Roman Soták

A matching $M$ in a graph $G$ is {\em semistrong} if every edge of $M$ has an endvertex of degree one in the subgraph induced by the vertices of $M$ . A {\em semistrong edge-colorin…

math.CO2021★ 1 cited

3-facial edge-coloring of plane graphs

Mirko Horňák, Borut Lužar, Kenny Štorgel

An $ℓ$ -facial edge-coloring of a plane graph is a coloring of its edges such that any two edges at distance at most $ℓ$ on a boundary walk of any face receive distinct colors…

math.CO2021★ 12 cited

Strong edge colorings of graphs and the covers of Kneser graphs

Borut Lužar, Edita Mačajová, Martin Škoviera +1

A proper edge coloring of a graph is strong if it creates no bichromatic path of length three. It is well known that for a strong edge coloring of a $k$ -regular graph at least $2k-…

math.CO2013

Strong edge coloring of subcubic bipartite graphs

Borut Lužar, Martina Mockovčiaková, Roman Soták +1

A strong edge coloring of a graph $G$ is a proper edge coloring in which each color class is an induced matching of $G$ . In 1993, Brualdi and Quinn Massey proposed a conjecture tha…