Benjamin R. Moore

According to our database, Benjamin R. Moore authored at least 23 papers between 2016 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

Orientations of Cycles in Digraphs of High Chromatic Number and High Minimum Out-Degree.

Hidde Koerts, Benjamin R. Moore, Sophie Spirkl

Comb., April, 2026

Characterizing Large Clique Number in Tournaments.

Logan Crew, Xinyue Fan, Hidde Koerts, Benjamin R. Moore, Sophie Spirkl

CoRR, February, 2026

2025

Beyond the pseudoforest strong Nine Dragon Tree Theorem.

Sebastian Mies, Benjamin R. Moore, Evelyne Smith-Roberge

Eur. J. Comb., 2025

Precoloring extension in planar near-Eulerian-triangulations.

Zdenek Dvorák, Benjamin R. Moore, Michaela Seifrtová, Robert Sámal

Eur. J. Comb., 2025

On heroes in digraphs with forbidden induced forests.

Alvaro Carbonero, Hidde Koerts, Benjamin R. Moore, Sophie Spirkl

Eur. J. Comb., 2025

Subchromatic numbers of powers of graphs with excluded minors.

Pedro P. Cortés, Pankaj Kumar, Benjamin R. Moore, Patrice Ossona de Mendez, Daniel A. Quiroz

Discret. Math., 2025

Smoothed Analysis for Graph Isomorphism.

Michael Anastos, Matthew Kwan, Benjamin R. Moore

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Decompositions into two linear forests of bounded lengths.

Rutger Campbell, Florian Hörsch, Benjamin R. Moore

Discret. Math., 2024

2023

The Strong Nine Dragon Tree Conjecture is True for $d \le k + 1$.

Sebastian Mies, Benjamin R. Moore

Comb., December, 2023

A density bound for triangle-free 4-critical graphs.

Benjamin R. Moore, Evelyne Smith-Roberge

J. Graph Theory, May, 2023

Recoloring Planar Graphs of Girth at Least Five.

Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin R. Moore, Théo Pierron

SIAM J. Discret. Math., March, 2023

Characterizing circular colouring mixing for p q 4 $\frac{p}{q}\lt 4$.

Richard C. Brewster, Benjamin R. Moore

J. Graph Theory, 2023

Local Hadwiger's Conjecture.

Benjamin R. Moore, Luke Postle, Lise Turner

J. Comb. Theory B, 2023

A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number.

Alvaro Carbonero, Patrick Hompe, Benjamin R. Moore, Sophie Spirkl

J. Comb. Theory B, 2023

2022

Square roots of nearly planar graphs.

Zdenek Dvorák, Benjamin R. Moore, Abhiruk Lahiri

CoRR, 2022

Digraphs with All Induced Directed Cycles of the Same Length are not $\vec{\chi}$-Bounded.

Alvaro Carbonero, Patrick Hompe, Benjamin R. Moore, Sophie Spirkl

Electron. J. Comb., 2022

2021

Cycles in Color-Critical Graphs.

Benjamin R. Moore, Douglas B. West

Electron. J. Comb., 2021

2020

Graph homomorphism reconfiguration and frozen H-colorings.

Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers

J. Graph Theory, 2020

The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true.

Logan Grout, Benjamin R. Moore

J. Comb. Theory B, 2020

2018

Reconfiguration of Graph Minors.

Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Reconfiguring Spanning and Induced Subgraphs.

Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Graph Homomorphism Reconfiguration and Frozen H-Colourings.

Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers

CoRR, 2017

2016

A dichotomy theorem for circular colouring reconfiguration.

Richard C. Brewster, Sean McGuinness, Benjamin R. Moore, Jonathan A. Noel

Theor. Comput. Sci., 2016