Showing 2026Show all
3 papers · 1 filter
math.CO2026
A Domatic Analogue of -Bounded Graph Classes and the Gyárfás-Sumner Conjecture
Quentin Chuet, Selma Djelloul, Hoang La +2
Given a graph , a dominating set is a subset such that . The \emph{domatic number} of , denoted , is the maximum size of a partitio…
math.CO2026
Frugal colourings of graphs via sparse hypergraph colouring
Quentin Chuet
A proper colouring of a graph is -frugal if every colour appears at most times in the neighbourhood of each vertex. Let denote the minimum number of colours req…
math.CO2026
Inversion diameter and 2-edge-colored homomorphisms
Carmen Arana, Thomas Bellitto, Hector Buffière +3
In an oriented graph, the inversion of a subset of vertices X is the operation reversing the direction of every arc with both endpoints in X. Given a graph G, the inversion distanc…