Jonathan A. Noel

most citedGraph Homomorphism Reconfiguration and Frozen

H

-Colourings

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

collaborators

3 papers

math.CO2019

Bounding the number of cycles in a graph in terms of its degree sequence

Zdeněk Dvořák, Natasha Morrison, Jonathan A. Noel +2

We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Király and Arman and Tsatur…

math.CO2019

Cycles of length three and four in tournaments

Timothy F. N. Chan, Andrzej Grzesik, Daniel Kral +1

Linial and Morgenstern conjectured that, among all $n$ -vertex tournaments with $d (3 n)$ cycles of length three, the number of cycles of length four is asymptotically minimiz…

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…

Bounding the number of cycles in a graph in terms of its degree sequence

Cycles of length three and four in tournaments

Graph Homomorphism Reconfiguration and Frozen H-Colourings

Graph Homomorphism Reconfiguration and Frozen $H$ -Colourings