Jonathan Rollin

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

2023

On the Geometric Thickness of 2-Degenerate Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2021

The interval number of a planar graph is at most three.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Edge-Minimum Saturated k-Planar Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

Regular colorings in regular graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

Minimal ordered Ramsey graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Edge-Minimum Saturated k-Planar Drawings.

[BibT_eX]

[DOI]

Steven Chaplick

CoRR, 2020

Augmenting Geometric Graphs with Matchings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

Induced and weak induced arboricities.

[BibT_eX]

[DOI]

Discret. Math., 2019

Recognizing Planar Laman Graphs.

[BibT_eX]

[DOI]

Lena Schlipf

André Schulz

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

The k-strong induced arboricity of a graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs.

[BibT_eX]

[DOI]

Comb., 2018

2017

Conditions on Ramsey Nonequivalence.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

The chromatic number of ordered graphs with constrained conflict graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2017

2015

Playing weighted Tron on trees.

[BibT_eX]

[DOI]

Discret. Math., 2015

Brooks type results for conflict-free colorings and {a, b}-factors in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Regular Augmentation of Planar Graphs.

[BibT_eX]

[DOI]

Tanja Hartmann

Ignaz Rutter

Algorithmica, 2015

2012

Cubic Augmentation of Planar Graphs.

[BibT_eX]

[DOI]

Tanja Hartmann