28 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of LjubljanaSI7 papers
- University of Pavol Jozef ŠafárikSK6 papers
- Comenius University BratislavaSK2 papers
- Institute of Mathematics, Physics, and MechanicsSI2 papers
- Rudolfovo – Science and Technology Centre Novo mestoSI2 papers
- School of Business and Management Novo MestoSI2 papers
- AGH University of KrakowPL1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Charles UniversityCZ1 paper
- Faculty of Applied Social Studies in Nova GoricaSI1 paper
- HTW Berlin - University of Applied SciencesDE1 paper
- Institut Polytechnique de BordeauxFR1 paper
14 papers
Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
Jaka Vodeb, Vid Eržen, Timotej Hrga +1
This paper investigates the performance of quantum, classical, and hybrid solvers on the NP-hard Max-Cut and QUBO problems, examining their solution quality relative to the global…
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…
Degree-balanced decompositions of cubic graphs
Borut Lužar, Jakub Przybyło, Roman Soták
We show that every cubic graph on vertices contains a spanning subgraph in which the number of vertices of each degree deviates from by at most , up…
Packing coloring of hypercubes with extended Hamming codes
Petr Gregor, Jaka Kranjc, Borut Lužar +1
A {\em packing coloring} of a graph is a mapping assigning a positive integer (a color) to every vertex of such that every two vertices of color are at distance at leas…
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…
Revisiting Semistrong Edge-Coloring of Graphs
Borut Lužar, Martina Mockovčiaková, Roman Soták
A matching in a graph is {\em semistrong} if every edge of has an endvertex of degree one in the subgraph induced by the vertices of . A {\em semistrong edge-colorin…
Terrorist attacks sharpen the binary perception of "Us" vs. "Them"
Milan Jović, Lovro Šubelj, Tea Golob +5
Terrorist attacks not only harm citizens but also shift their attention, which has long-lasting impacts on public opinion and government policies. Yet measuring the changes in publ…
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…
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 -regular graph at least $2k-…
Between proper and strong edge-colorings of subcubic graphs
Hervé Hocquard, Dimitri Lajou, Borut Lu{ž}ar
In a proper edge-coloring the edges of every color form a matching. A matching is induced if the end-vertices of its edges induce a matching. A strong edge-coloring is an edge-colo…
BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints
Nicolò Gusmeroli, Timotej Hrga, Borut Lužar +3
We present BiqBin, an exact solver for linearly constrained binary quadratic problems. Our approach is based on an exact penalty method to first efficiently transform the original…
Forbidden branches in trees with minimal atom-bond connectivity index
Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca
The atom-bond connectivity (ABC) index has been, in recent years, one of the most actively studied vertex-degree-based graph invariants in chemical graph theory. For a given graph…
Quantifying the consistency of scientific databases
Lovro Šubelj, Marko Bajec, Biljana Mileva Boshkoska +2
Science is a social process with far-reaching impact on our modern society. In the recent years, for the first time we are able to scientifically study the science itself. This is…
Strong edge coloring of subcubic bipartite graphs
Borut Lužar, Martina Mockovčiaková, Roman Soták +1
A strong edge coloring of a graph is a proper edge coloring in which each color class is an induced matching of . In 1993, Brualdi and Quinn Massey proposed a conjecture tha…