4 citations · 12 across the 17 of their papers we have counts for
5 papers · 1 filter
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…
Local Hadwiger's Conjecture
Benjamin Moore, Luke Postle, Lise Turner
We propose local versions of Hadwiger's Conjecture, where only balls of radius around each vertex are required to be -minor-free. We ask: if a graph is local…
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
Alvaro Carbonero, Patrick Hompe, Benjamin Moore +1
We prove that for every , there is a graph with and such that every induced subgraph of with satisfies . This…