4 citations · 12 across the 17 of their papers we have counts for
22 papers
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…
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…
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…
The Strong Nine Dragon Tree Conjecture is true for
Sebastian Mies, Benjamin Moore
The arboricity of an undirected graph is the minimal number such that can be partitioned into forests. Nash-Williams' formula states that $k = \lceil…
Square roots of nearly planar graphs
Zdeněk Dvořák, Benjamin Moore, Abhiruk Lahiri
We prove that it is NP-hard to decide whether a graph is the square of a 6-apex graph. This shows that the square root problem is not tractable for squares of sparse graphs (or eve…
Digraphs with all induced directed cycles of the same length are not -bounded
Alvaro Carbonero, Patrick Hompe, Benjamin Moore +1
For , let us call a digraph \emph{t-chordal} if all induced directed cycles in have length equal to . In a previous paper, we asked for which it is true tha…