Jonathan Rollin

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Edge‐minimum saturated k $k$‐planar drawings 2024 Steven Chaplick
Fabian Klute
Irene Parada
Jonathan Rollin
Torsten Ueckerdt
+ PDF Chat Ramsey Equivalence for Asymmetric Pairs of Graphs 2024 Simona Boyadzhiyska
Dennis Clemens
Pranshu Gupta
Jonathan Rollin
+ On the geometric thickness of 2-degenerate graphs 2023 Rahul Jain
M. Ricci
Jonathan Rollin
André Schulz
+ On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs 2023 Benedikt Künzel
Jonathan Rollin
+ Ramsey equivalence for asymmetric pairs of graphs 2022 Simona Boyadzhiyska
Dennis Clemens
Pranshu Gupta
Jonathan Rollin
+ PDF Chat Edge-Minimum Saturated k-Planar Drawings 2021 Steven Chaplick
Fabian Klute
Irene Parada
Jonathan Rollin
Torsten Ueckerdt
+ Edge-Minimum Saturated k-Planar Drawings 2020 Steven Chaplick
Fabian Klute
Irene Parada
Jonathan Rollin
Torsten Ueckerdt
+ Augmenting Geometric Graphs with Matchings 2020 Alexander Pilz
Jonathan Rollin
Lena Schlipf
André Schulz
+ The interval number of a planar graph is at most three 2020 Guillaume Guégan
Kolja Knauer
Jonathan Rollin
Torsten Ueckerdt
+ Minimal ordered Ramsey graphs 2020 Jonathan Rollin
+ PDF Chat Augmenting Geometric Graphs with Matchings 2020 Alexander Pilz
Jonathan Rollin
Lena Schlipf
André Schulz
+ Edge-Minimum Saturated k-Planar Drawings 2020 Steven Chaplick
Fabian Klute
Irene Parada
Jonathan Rollin
Torsten Ueckerdt
+ Augmenting Geometric Graphs with Matchings 2020 Alexander Pilz
Jonathan Rollin
Lena Schlipf
André Schulz
+ Induced and weak induced arboricities 2018 Maria Axenovich
Philip Dörr
Jonathan Rollin
Torsten Ueckerdt
+ The interval number of a planar graph is at most three 2018 Guillaume Guégan
Kolja Knauer
Jonathan Rollin
Torsten Ueckerdt
+ Induced and Weak Induced Arboricities. 2018 Maria Axenovich
Philip Dörr
Jonathan Rollin
Torsten Ueckerdt
+ Induced and Weak Induced Arboricities 2018 Maria Axenovich
Philip Dörr
Jonathan Rollin
Torsten Ueckerdt
+ The interval number of a planar graph is at most three 2018 Guillaume Guégan
Kolja Knauer
Jonathan Rollin
Torsten Ueckerdt
+ Minimal Ordered Ramsey Graphs 2017 Jonathan Rollin
+ PDF Chat Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs 2017 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
+ PDF Chat The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml36" display="inline" overflow="scroll" altimg="si36.gif"><mml:mi>k</mml:mi></mml:math>-strong induced arboricity of a graph 2017 Maria Axenovich
Daniel Gonçalves
Jonathan Rollin
Torsten Ueckerdt
+ PDF Chat Conditions on Ramsey Nonequivalence 2017 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
+ Extremal and Ramsey Type Questions for Graphs and Ordered Graphs 2017 Jonathan Rollin
+ Minimal Ordered Ramsey Graphs 2017 Jonathan Rollin
+ The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs 2016 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
+ The $k$-strong induced arboricity of a graph 2016 Maria Axenovich
Daniel Gonçalves
Jonathan Rollin
Torsten Ueckerdt
+ Chromatic number of ordered graphs with forbidden ordered subgraphs 2016 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
+ Regular colorings and factors of regular graphs 2016 Anton Bernshteyn
Omid Khormali
Ryan R. Martin
Jonathan Rollin
Danny Rorabaugh
Songling Shan
Andrew J. Uzzell
+ The chromatic number of ordered graphs with constrained conflict graphs 2016 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
+ The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs 2016 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
+ Chromatic number of ordered graphs with forbidden ordered subgraphs 2016 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
+ The $k$-strong induced arboricity of a graph 2016 Maria Axenovich
Daniel Gonçalves
Jonathan Rollin
Torsten Ueckerdt
+ Brooks type results for conflict-free colorings and<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>{</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>}</mml:mo></mml:mrow></mml:math>-factors in graphs 2015 Maria Axenovich
Jonathan Rollin
+ PDF Chat Playing weighted Tron on trees 2015 Daniel Hoske
Jonathan Rollin
Torsten Ueckerdt
Stefan Walzer
+ Conditions on Ramsey non-equivalence 2015 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
+ Conditions on Ramsey non-equivalence 2015 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
+ Playing weighted Tron on Trees 2014 Daniel Hoske
Jonathan Rollin
Torsten Ueckerdt
Stefan Walzer
+ Brooks Type Results for Conflict-Free Colorings and {a, b}-factors in graphs 2014 Maria Axenovich
Jonathan Rollin
+ Brooks Type Results for Conflict-Free Colorings and {a, b}-factors in graphs 2014 Maria Axenovich
Jonathan Rollin
+ Playing weighted Tron on Trees 2014 Daniel Hoske
Jonathan Rollin
Torsten Ueckerdt
Stefan Walzer
+ Cubic Augmentation of Planar Graphs 2012 Tanja Hartmann
Jonathan Rollin
Ignaz Rutter
+ PDF Chat Cubic Augmentation of Planar Graphs 2012 Tanja Hartmann
Jonathan Rollin
Ignaz Rutter
+ Cubic Augmentation of Planar Graphs 2012 Tanja Nicole Hartmann
Jonathan Rollin
Ignaz Rutter
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Ordered Ramsey numbers 2016 David Conlon
Jacob Fox
Choongbum Lee
Benny Sudakov
6
+ PDF Chat Threshold functions for Ramsey properties 1995 Vojtěch Rödl
Andrzej Ruciński
5
+ A turán-type theorem on chords of a convex polygon 1992 Vasilis Capoyleas
János Pach
5
+ PDF Chat Ramsey numbers of ordered graphs 2015 Martin Balko
Josef Cibulka
Karel Král
Jan Kynčl
5
+ The Ramsey property for graphs with forbidden complete subgraphs 1976 Jaroslav Nešetřil
Vojtěch Rödl
5
+ PDF Chat Ramsey minimal graphs 2001 Béla Bollobás
Jair Donadelli
Yoshiharu Kohayakawa
R. H. Schelp
4
+ On the minimum degree of minimal Ramsey graphs 2010 Tibor Szabó
Philipp Zumstein
Stefanie Zürcher
4
+ On acyclic colorings of planar graphs 2006 O. V. Borodin
4
+ What is Ramsey-equivalent to a clique? 2014 Jacob Fox
Andrey Grinshpun
Anita Liebenau
Yury Person
Tibor Szabó
4
+ Extremal problems for ordered (hyper)graphs: applications of Davenport–Schinzel sequences 2003 Martin Klazar
4
+ Extremal problems for ordered hypergraphs: small patterns and some enumeration 2004 Martin Klazar
4
+ ON GRAPHS OF RAMSEY TYPE 1976 Péter L. Erdős
László Lovász
4
+ PDF Chat Forbidden paths and cycles in ordered graphs and matrices 2006 János Pach
Gábor Tardos
4
+ Graph Theory and Probability 2009 P. Erdős
4
+ On 0–1 matrices and small excluded submatrices 2005 Gábor Tardos
4
+ What we know and what we do not know about Turán numbers 1995 Alexander Sidorenko
3
+ Saturated simple and k-simple topological graphs 2014 Jan Kynčl
János Pach
Radoš Radoičić
Gézá Tóth
3
+ PDF Chat Conditions on Ramsey Nonequivalence 2017 Maria Axenovich
Jonathan Rollin
Torsten Ueckerdt
3
+ PDF Chat On the minimum degree of minimal Ramsey graphs 2009 Tibor Szabó
Philipp Zumstein
Stefanie Zürcher
3
+ PDF Chat Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n 2014 Martin Balko
Radoslav Fulek
Jan Kynčl
3
+ Ramsey-minimal graphs for forests 1982 Stefan Burr
Péter L. Erdős
Ralph J. Faudree
Cecil Rousseau
R. H. Schelp
3
+ On the use of senders in generalized ramsey theory for graphs 1985 Stefan Burr
Jaroslav Nešetřil
Vojtěch Rödl
3
+ PDF Chat Improvements on the density of maximal 1‐planar graphs 2017 János Barát
Gézá Tóth
3
+ On topological graphs with at most four crossings per edge 2019 Eyal Ackerman
3
+ Hypergraph Turán problems 2011 Peter Keevash
3
+ A Survey of Minimum Saturated Graphs 2011 Jill R. Faudree
Ralph J. Faudree
John R. Schmitt
3
+ Saturated simple and 2-simple topological graphs with few edges 2018 Peter I. Hajnal
Alexander Igamberdiev
Günter Rote
André Schulz
3
+ Excluded permutation matrices and the Stanley–Wilf conjecture 2004 Adam W. Marcus
Gábor Tardos
3
+ On Ramsey Minimal Graphs 1994 Tomasz Łuczak
3
+ Ramsey-minimal graphs for star-forests 1981 Stefan Burr
Paul Erdős
Ralph J. Faudree
Cecil Rousseau
R. H. Schelp
3
+ On a Problem of Formal Logic 1930 Frank Plumpton Ramsey
3
+ PDF Chat Locally identifying coloring in bounded expansion classes of graphs 2013 Daniel Gonçalves
Aline Parreau
Alexandre Pinlou
2
+ The fractional version of Hedetniemi’s conjecture is true 2011 Xuding Zhu
2
+ PDF Chat On chromatic number of graphs and set systems 1973 Paul Erdös
A. Hajnal
B. Rothchild
2
+ PDF Chat Graph Treewidth and Geometric Thickness Parameters 2007 Vida Dujmović
David R. Wood
2
+ PDF Chat Generalized Ramsey theory for graphs. II. Small diagonal numbers 1972 Václav Chvátal
Frank Harary
2
+ None 1999 Peter Hamburger
Alexandr Kostochka
Alexander Sidorenko
2
+ PDF Chat Two variants of the size Ramsey number 2005 Andrzej Kurek
Andrzej Ruciński
2
+ PDF Chat Degree Ramsey Numbers of Closed Blowups of Trees 2014 Paul Horn
Kevin G. Milans
Vojtěch Rödl
2
+ Sharp thresholds for certain Ramsey properties of random graphs 2000 Ehud Friedgut
Michael Krivelevich
2
+ PDF Chat On globally sparse Ramsey graphs 2013 Torsten Mütze
Ueli Peter
2
+ Threshold functions for small subgraphs 1981 Béla Bollobás
2
+ On Ramsey graphs without bipartite subgraphs 1992 Jaroslav Nešetřil
Vojtěch Rödl
2
+ Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers 1997 Honghui Wan
2
+ None 2009 Alex Gamburd
Shlomo Hoory
Mehrdad Shahshahani
Aner Shalev
Bálint Virág
2
+ Generalized and geometric Ramsey numbers for cycles 2001 Gyula Károlyi
Vera Rosta
2
+ Graph Minors. XX. Wagner's conjecture 2004 Neil Robertson
Paul Seymour
2
+ Diagonal Ramsey numbers for small graphs 1983 Stefan Burr
2
+ None 2006 C. Paul Bonnington
R. Bruce Richter
Mark E. Watkins
2
+ Regular Graphs with Given Girth and Restricted Circuits 1963 H. Sachs
2