default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Davies 0001
Person information
- affiliation: Leipzig University, Germany
- affiliation (former): University of Cambridge, UK
- affiliation (former): University of Waterloo, Canada
Other persons with the same name
- James Davies — disambiguation page
- James Davies 0002
![[0000-0001-7987-2378]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-7987-2378")
— University of New South Wales Sydney, Sydney, Australia - James Davies 0003 — University of Wisconsin-Madison, Madison, WI, USA
- James Davies 0004 — Cardiff University, UK
- James Davies 0005 — University of Western Ontario, London, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j10]Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum:
Reuniting χ-boundedness with polynomial χ-boundedness. J. Comb. Theory B 176: 30-73 (2026)- [c4]Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masaríková, Pawel Rzazewski, Bartosz Walczak:
Burling Graphs in Graphs with Large Chromatic Number. SODA 2026: 3978-3998 - 2025
- [j9]James Davies:
Pivot-minors and the Erdős-Hajnal conjecture. J. Comb. Theory B 173: 257-278 (2025) - [j8]Matija Bucic, James Davies:
Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth. Am. Math. Mon. 132(9): 883-894 (2025) - [c3]James Davies, Agelos Georgakopoulos, Meike Hatzel, Rose McCarty:
Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs. SoCG 2025: 36:1-36:16 - [i13]James Davies, Andrew Jena:
Preparing graph states forbidding a vertex-minor. CoRR abs/2504.00291 (2025) - [i12]James Davies, Agelos Georgakopoulos, Meike Hatzel, Rose McCarty:
Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs. CoRR abs/2504.00932 (2025) - [i11]James Davies, Meike Hatzel, Kolja Knauer, Rose McCarty, Torsten Ueckerdt:
Odd coloring graphs with linear neighborhood complexity. CoRR abs/2506.08926 (2025) - [i10]James Davies:
String graphs are quasi-isometric to planar graphs. CoRR abs/2510.19602 (2025) - [i9]Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masaríková, Pawel Rzazewski, Bartosz Walczak:
Burling graphs in graphs with large chromatic number. CoRR abs/2510.19650 (2025) - 2024
- [j7]Marcin Brianski, James Davies, Bartosz Walczak:
Separating Polynomial χ-Boundedness from χ-Boundedness. Comb. 44(1): 1-8 (2024) - [i8]James Davies, Yelena Yuditsky:
Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity. CoRR abs/2407.16882 (2024) - [i7]James Davies, Meike Hatzel, Liana Yepremyan:
Counterexample to Babai's lonely colour conjecture. CoRR abs/2410.05199 (2024) - [i6]Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum, Jane Tan:
Colouring t-perfect graphs. CoRR abs/2412.17735 (2024) - 2023
- [j6]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Grounded L-Graphs Are Polynomially χ-Bounded. Discret. Comput. Geom. 70(4): 1523-1550 (2023) - [j5]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Coloring polygon visibility graphs and their generalizations. J. Comb. Theory B 161: 268-300 (2023) - [j4]James Davies:
Triangle-free graphs with large chromatic number and no induced wheel. J. Graph Theory 103(1): 112-118 (2023) - [i5]Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum:
Reuniting χ-boundedness with polynomial χ-boundedness. CoRR abs/2310.11167 (2023) - 2022
- [j3]James Davies:
Vertex-Minor-Closed Classes are χ-Bounded. Comb. 42(6): 1049-1079 (2022) - [c2]James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
A Solution to Ringel's Circle Problem. SoCG 2022: 33:1-33:14 - [i4]Marcin Brianski, James Davies, Bartosz Walczak:
Separating polynomial χ-boundedness from χ-boundedness. CoRR abs/2201.08814 (2022) - 2021
- [j2]James Davies, Florian Pfender:
Edge-maximal graphs on orientable and some nonorientable surfaces. J. Graph Theory 98(3): 405-425 (2021) - [c1]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Colouring Polygon Visibility Graphs and Their Generalizations. SoCG 2021: 29:1-29:16 - [i3]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Colouring polygon visibility graphs and their generalizations. CoRR abs/2103.07803 (2021) - [i2]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Grounded L-graphs are polynomially χ-bounded. CoRR abs/2108.05611 (2021) - [i1]James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, Bartosz Walczak:
A solution to Ringel's circle problem. CoRR abs/2112.05042 (2021) - 2020
- [j1]James Davies, Carsten Thomassen:
Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface. Electron. J. Comb. 27(2): 2 (2020)
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 2026-03-07 23:05 CET 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:
