research
∙
04/19/2021
On sublinear approximations for the Petersen coloring conjecture
If f:ℕ→ℕ is a function, then let us say that f is sublinear if lim_...
share
research
∙
09/21/2019
An algorithm and new bounds for the circular flow number of snarks
It is well-known that the circular flow number of a bridgeless cubic gra...
research
∙
04/04/2019
Normal 5-edge-colorings of a family of Loupekhine snarks
In a proper edge-coloring of a cubic graph an edge uv is called poor or ...
research
∙
03/13/2019
Normal 6-edge-colorings of some bridgeless cubic graphs
In an edge-coloring of a cubic graph, an edge is poor or rich, if the se...
research
∙
04/25/2018
Normal edge-colorings of cubic graphs
A normal k-edge-coloring of a cubic graph is an edge-coloring with k col...
research
∙
04/03/2018
