default search action
Fiachra Knox
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j13]Fiachra Knox, Bojan Mohar, Nathan Singer
:
Reflexive coloring complexes for 3-edge-colorings of cubic graphs. Discret. Math. 344(4): 112309 (2021) - [j12]Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed:
Cops and robbers on oriented toroidal grids. Theor. Comput. Sci. 857: 166-176 (2021) - 2020
- [j11]Fiachra Knox, Bojan Mohar:
Maximum number of colourings: 4-chromatic graphs. J. Comb. Theory B 144: 95-118 (2020) - [j10]Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar:
Cops and Robbers on Graphs of Bounded Diameter. SIAM J. Discret. Math. 34(2): 1375-1384 (2020)
2010 – 2019
- 2019
- [j9]Fiachra Knox, Bojan Mohar:
Maximum Number of Colourings: 5-Chromatic Case. Electron. J. Comb. 26(3): 3 (2019) - [j8]Fiachra Knox, Bojan Mohar:
Fractional Decompositions and the Smallest-eigenvalue Separation. Electron. J. Comb. 26(4): 4 (2019) - [j7]Fiachra Knox, Bojan Mohar, David R. Wood
A Golden Ratio Inequality for Vertex Degrees of Graphs. Am. Math. Mon. 126(8): 742-747 (2019) - [i2]Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed:
Cops and robbers on oriented toroidal grids. CoRR abs/1904.10113 (2019) - [i1]Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar:
Cops and Robbers on graphs of bounded diameter. CoRR abs/1912.07203 (2019) - 2018
- [j6]Fiachra Knox, Robert Sámal
Linear Bound for Majority Colourings of Digraphs. Electron. J. Comb. 25(3): 3 (2018) - 2017
- [j5]Fiachra Knox, Naoki Matsumoto, Sebastián González Hermosillo de la Maza
Proper Orientations of Planar Bipartite Graphs. Graphs Comb. 33(5): 1189-1194 (2017) - 2015
- [j4]Tien-Nam Le
Every 3-colorable graph has a faithful representation in the odd-distance graph. Discret. Math. 338(9): 1614-1620 (2015) - [j3]Fiachra Knox, Daniela Kühn, Deryk Osthus:
Edge-disjoint Hamilton cycles in random graphs. Random Struct. Algorithms 46(3): 397-445 (2015) - 2013
- [j2]Fiachra Knox, Andrew Treglown:
Embedding Spanning Bipartite Graphs of Small Bandwidth. Comb. Probab. Comput. 22(1): 71-96 (2013) - [c1]Peter Keevash, Fiachra Knox, Richard Mycroft:
Polynomial-time perfect matchings in dense hypergraphs. STOC 2013: 311-320 - 2012
- [j1]Fiachra Knox, Daniela Kühn, Deryk Osthus:
Approximate Hamilton decompositions of random graphs. Random Struct. Algorithms 40(2): 133-149 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: