B. Moore

activity

20172020

most citedGraph Homomorphism Reconfiguration and Frozen

H

-Colourings

4 citations · 6 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2020

Sparse $4$ -critical graphs have low circular chromatic number

Benjamin Moore

Kostochka and Yancey proved that every $4$ -critical graph $G$ has $e (G) \geq \frac{5 v ( G ) - 2}{3}$ , and that equality holds if and only if $G$ is $4$ -Ore. We show that a question of…

math.CO2019

An Approximate Version of the Strong Nine Dragon Tree Conjecture

Benjamin Moore

The Strong Nine Dragon Tree Conjecture asserts that for any integers $k$ and $d$ any graph with fractional arboricity at most $k + \frac{d}{d + k + 1}$ decomposes into $k + 1$ forests, s…

math.CO2019

The Pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is True

Logan Grout, Benjamin Moore

We prove that for any positive integers $k$ and $d$ , if a graph $G$ has maximum average degree at most $2 k + \frac{2 d}{d + k + 1}$ , then $G$ decomposes into $k + 1$ pseudoforests $C_{1},…

math.CO2019★ 2 cited

On Decomposing Graphs Into Forests and Pseudoforests

Logan Grout, Benjamin Moore

We prove that for $k \in N$ and $d \leq 2 k + 2$ , if a graph has maximum average degree at most $2 k + \frac{2 d}{d + k + 1}$ , then $G$ decomposes into $k + 1$ pseudoforests, where o…

math.CO2017★ 4 cited

Graph Homomorphism Reconfiguration and Frozen $H$ -Colourings

Richard C. Brewster, Jae-Baek Lee, Benjamin Moore +2

For a fixed graph $H$ , the reconfiguration problem for $H$ -colourings (i.e. homomorphisms to $H$ ) asks: given a graph $G$ and two $H$ -colourings $φ$ and $ψ$ of $G$ , does there exis…

math.CO2017

On the structure of graphs excluding $K_{4}$ , $W_{4}$ , $K_{2, 4}$ and one other graph as a rooted minor

Benjamin Moore

In this paper we give structural characterizations of graphs not containing rooted $K_{4}$ , $W_{4}$ , $K_{2, 4}$ , and a graph we call $L$ .

Sparse 4-critical graphs have low circular chromatic number

An Approximate Version of the Strong Nine Dragon Tree Conjecture

The Pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is True

On Decomposing Graphs Into Forests and Pseudoforests

Graph Homomorphism Reconfiguration and Frozen H-Colourings

On the structure of graphs excluding K4​, W4​, K2,4​ and one other graph as a rooted minor

Sparse $4$ -critical graphs have low circular chromatic number

Graph Homomorphism Reconfiguration and Frozen $H$ -Colourings

On the structure of graphs excluding $K_{4}$ , $W_{4}$ , $K_{2, 4}$ and one other graph as a rooted minor