1 citations · 1 across the 2 of their papers we have counts for
4 papers
Circular -coloring of some classes of signed graphs
František Kardoš, Jonathan Narboni, Reza Naserasr +1
A circular -coloring of a signed graph is an assignment of points of a circle of circumference to the vertices of such that for each positive edg…
On Vizing's edge colouring question
Marthe Bonamy, Oscar Defrain, Tereza Klimošová +2
Soon after his 1964 seminal paper on edge colouring, Vizing asked the following question: can an optimal edge colouring be reached from any given proper edge colouring through a se…
A note on connected greedy edge colouring
Marthe Bonamy, Carla Groenland, Carole Muller +3
Following a given ordering of the edges of a graph , the greedy edge colouring procedure assigns to each edge the smallest available colour. The minimum number of colours thus i…
On the 4-color theorem for signed graphs
František Kardoš, Jonathan Narboni
There are several ways to generalize graph coloring to signed graphs. Máčajová, Raspaud and Škoviera introduced one of them and conjectured that in this setting, for signed planar…