4 citations · 7 across the 5 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
Precoloring extension in planar near-Eulerian-triangulations
Zdeněk Dvořák, Benjamin Moore, Michaela Seifrtová +1
We consider the 4-precoloring extension problem in \emph{planar near-Eulerian-triangulations}, i.e., plane graphs where all faces except possibly for the outer one have length thre…
math.CO2023★ 1 cited
On heroes in digraphs with forbidden induced forests
Alvaro Carbonero, Hidde Koerts, Benjamin Moore +1
We continue a line of research which studies which hereditary families of digraphs have bounded dichromatic number. For a class of digraphs , a hero in i…
math.CO2023
Subchromatic numbers of powers of graphs with excluded minors
Pedro P. Cortés, Pankaj Kumar, Benjamin Moore +2
A -subcolouring of a graph is a function such that the set of vertices coloured induce a disjoint union of cliques. The subchromatic number…