Benjamin Moore

From MaRDI portal
Person:301586

Available identifiers

zbMath Open moore.benjamin-rMaRDI QIDQ301586

List of research outcomes





PublicationDate of PublicationType
On heroes in digraphs with forbidden induced forests2025-01-16Paper
The strong nine dragon tree conjecture is true for \(d \le k + 1\)2024-01-25Paper
Precoloring extension in planar near-Eulerian-triangulations2023-12-20Paper
A density bound for triangle‐free 4‐critical graphs2023-10-09Paper
Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$2023-10-06Paper
Beyond the Pseudoforest Strong Nine Dragon Tree Theorem2023-10-02Paper
Local Hadwiger's conjecture2023-08-10Paper
On heroes in digraphs with forbidden induced forests2023-06-07Paper
Recoloring Planar Graphs of Girth at Least Five2023-03-30Paper
Decompositions into two linear forests of bounded lengths2023-01-27Paper
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number2022-11-28Paper
Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded2022-11-08Paper
The Strong Nine Dragon Tree Conjecture is true for $d \leq k+1$2022-08-12Paper
Square roots of nearly planar graphs2022-05-25Paper
Cycles in color-critical graphs2022-04-04Paper
Graph homomorphism reconfiguration and frozen H‐colorings2022-03-31Paper
Recolouring planar graphs of girth at least five2021-12-01Paper
Graph minors and the linear reducibility of Feynman diagrams2021-11-24Paper
https://portal.mardi4nfdi.de/entity/Q50051792021-08-04Paper
The pseudoforest analogue for the strong nine dragon tree conjecture is true2020-09-24Paper
Sparse $4$-critical graphs have low circular chromatic number2020-07-30Paper
Reconfiguring spanning and induced subgraphs2020-01-16Paper
An Approximate Version of the Strong Nine Dragon Tree Conjecture2019-09-17Paper
On Decomposing Graphs Into Forests and Pseudoforests2019-04-28Paper
Reconfiguring spanning and induced subgraphs2018-10-04Paper
Reconfiguration of graph minors2018-04-24Paper
On the structure of graphs excluding $K_{4}$, $W_{4}$, $K_{2,4}$ and one other graph as a rooted minor2017-08-11Paper
Graph Minors and the Linear Reducibility of Feynman Diagrams2017-08-04Paper
Rooted Graph Minors and Reducibility of Graph Polynomials2017-04-15Paper
A dichotomy theorem for circular colouring reconfiguration2016-06-30Paper
Subchromatic numbers of powers of graphs with excluded minorsN/APaper
The Strong Nine Dragon Tree Conjecture is True for $d \leq 2(k+1)$N/APaper

Research outcomes over time

This page was built for person: Benjamin Moore