Fiachra Knox

According to our database, Fiachra Knox authored at least 14 papers between 2012 and 2021.

Collaborative distances:

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

2021

Cops and robbers on oriented toroidal grids.

Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed

Theor. Comput. Sci., 2021

Reflexive coloring complexes for 3-edge-colorings of cubic graphs.

Fiachra Knox, Bojan Mohar, Nathan Singer

Discret. Math., 2021

2020

Cops and Robbers on Graphs of Bounded Diameter.

Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar

SIAM J. Discret. Math., 2020

Maximum number of colourings: 4-chromatic graphs.

Fiachra Knox, Bojan Mohar

J. Comb. Theory, Ser. B, 2020

2019

A Golden Ratio Inequality for Vertex Degrees of Graphs.

Fiachra Knox, Bojan Mohar, David R. Wood

Am. Math. Mon., 2019

Fractional Decompositions and the Smallest-eigenvalue Separation.

Fiachra Knox, Bojan Mohar

Electron. J. Comb., 2019

Maximum Number of Colourings: 5-Chromatic Case.

Fiachra Knox, Bojan Mohar

Electron. J. Comb., 2019

2018

Linear Bound for Majority Colourings of Digraphs.

Fiachra Knox, Robert Sámal

Electron. J. Comb., 2018

2017

Proper Orientations of Planar Bipartite Graphs.

Fiachra Knox, Naoki Matsumoto, Sebastián González Hermosillo de la Maza, Bojan Mohar, Cláudia Linhares Sales

Graphs Comb., 2017

2015

Edge-disjoint Hamilton cycles in random graphs.

Fiachra Knox, Daniela Kühn, Deryk Osthus

Random Struct. Algorithms, 2015

Every 3-colorable graph has a faithful representation in the odd-distance graph.

Tien-Nam Le, Fiachra Knox, Moshe Rosenfeld

Discret. Math., 2015

2013

Embedding Spanning Bipartite Graphs of Small Bandwidth.

Fiachra Knox, Andrew Treglown

Comb. Probab. Comput., 2013

Polynomial-time perfect matchings in dense hypergraphs.

Peter Keevash, Fiachra Knox, Richard Mycroft

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Approximate Hamilton decompositions of random graphs.

Fiachra Knox, Daniela Kühn, Deryk Osthus

Random Struct. Algorithms, 2012