Benjamin R. Moore

Orcid: 0000-0003-4151-414X

According to our database1, Benjamin R. Moore authored at least 15 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A density bound for triangle-free 4-critical graphs.
J. Graph Theory, May, 2023

Characterizing circular colouring mixing for p q 4 $\frac{p}{q}\lt 4$.
J. Graph Theory, 2023

Local Hadwiger's Conjecture.
J. Comb. Theory, Ser. B, 2023

A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number.
J. Comb. Theory, Ser. B, 2023

Subchromatic numbers of powers of graphs with excluded minors.
CoRR, 2023

Decompositions into two linear forests of bounded lengths.
CoRR, 2023

2022
Square roots of nearly planar graphs.
CoRR, 2022

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

2021
Cycles in Color-Critical Graphs.
Electron. J. Comb., 2021

2020
Reconfiguring spanning and induced subgraphs.
Theor. Comput. Sci., 2020

Graph homomorphism reconfiguration and frozen H-colorings.
J. Graph Theory, 2020

The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true.
J. Comb. Theory, Ser. B, 2020

2018
Reconfiguration of Graph Minors.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Graph Homomorphism Reconfiguration and Frozen H-Colourings.
CoRR, 2017

2016
A dichotomy theorem for circular colouring reconfiguration.
Theor. Comput. Sci., 2016


  Loading...