Showing 2025Show all
2 papers · 1 filter
math.CO2025
Fractional domatic number and minimum degree
Quentin Chuet, Hugo Demaret, Hoang La +1
The domatic number of a graph is the maximum number of pairwise disjoint dominating sets of . We are interested in the LP-relaxation of this parameter, which is called the f…
math.CO2025
New bounds for proper -conflict-free colourings
Quentin Chuet, Tianjiao Dai, Qiancheng Ouyang +1
A proper -colouring of a graph is called -conflict-free if every vertex has at least colours appearing exactly once in its neighbourhood.…