Raphael Steiner

J. Comb. Theory B, March, 2024

On the choosability of -minor-free graphs.

[BibT_eX]

[DOI]

Olivier Fischer

Comb. Probab. Comput., March, 2024

Subdivisions with congruence constraints in digraphs of large chromatic number.

[BibT_eX]

[DOI]

J. Graph Theory, January, 2024

Subdigraphs of prescribed size and out-degree.

[BibT_eX]

[DOI]

J. Graph Theory, January, 2024

Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs.

[BibT_eX]

[DOI]

Anders Martinsson

J. Comb. Theory B, January, 2024

Chromatic number is not tournament-local.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

Hadwiger's conjecture and topological bounds.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Coloring hypergraphs with excluded minors.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Coloring circle arrangements: New 4-chromatic planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Longest cycles in vertex-transitive and highly connected graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Hardness of circuit and monotone diameters of polytopes.

[BibT_eX]

[DOI]

Christian Nöbel

CoRR, 2024

On an Induced Version of Menger's Theorem.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

Topological Drawings Meet Classical Theorems from Convex Geometry.

[BibT_eX]

[DOI]

Discret. Comput. Geom., October, 2023

Hat Guessing Numbers of Strongly Degenerate Graphs.

[BibT_eX]

[DOI]

Charlotte Knierim

Anders Martinsson

SIAM J. Discret. Math., June, 2023

On coloring digraphs with forbidden induced subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, June, 2023

Improved bound for improper colourings of graphs with no odd clique minor.

[BibT_eX]

[DOI]

Comb. Probab. Comput., March, 2023

Cycle lengths modulo k in expanders.

[BibT_eX]

[DOI]

Anders Martinsson

Eur. J. Comb., 2023

Odd Hadwiger for line-graphs.

[BibT_eX]

[DOI]

Discret. Math., 2023

Matching theory and Barnette's conjecture.

[BibT_eX]

[DOI]

Maximilian Gorsky

Discret. Math., 2023

Twin-width of sparse random graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Shortest paths on polymatroids and hypergraphic polytopes.

[BibT_eX]

[DOI]

Jean Cardinal

CoRR, 2023

Exact Matching: Correct Parity and FPT Parameterized by Independence Number.

[BibT_eX]

[DOI]

Nicolas El Maalouly

Lasse Wulf

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Inapproximability of Shortest Paths on Perfect Matching Polytopes.

[BibT_eX]

[DOI]

Jean Cardinal

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Linear Size Universal Point Sets for Classes of Planar Graphs.

[BibT_eX]

[DOI]

Felix Schröder

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

On Connectivity in Random Graph Models with Limited Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

Oriented Cycles in Digraphs of Large Outdegree.

[BibT_eX]

[DOI]

Lior Gishboliner

Tibor Szabó

Comb., December, 2022

Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Heroes in Orientations of Chordal Graphs.

[BibT_eX]

[DOI]

Pierre Aboulker

Guillaume Aubian

SIAM J. Discret. Math., 2022

Complete directed minors and chromatic number.

[BibT_eX]

[DOI]

Tamás Mészáros

J. Graph Theory, 2022

Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Dichromatic number and forced subdivisions.

[BibT_eX]

[DOI]

Lior Gishboliner

Tibor Szabó

J. Comb. Theory B, 2022

The star dichromatic number.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

Colorings of oriented planar graphs avoiding a monochromatic subgraph.

[BibT_eX]

[DOI]

Helena Bergold

Discret. Appl. Math., 2022

Improved lower bound for the list chromatic number of graphs with no Kt minor.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

Even circuits in oriented matroids.

[BibT_eX]

[DOI]

Karl Heuer

Comb. Theory, 2022

Disproof of a Conjecture by Woodall on the Choosability of $K_{s, t}$-Minor-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Colouring Non-Even Digraphs.

[BibT_eX]

[DOI]

Marcelo Garlet Millani

Electron. J. Comb., 2022

Coloring Drawings of Graphs.

[BibT_eX]

[DOI]

Christoph Hertrich

Felix Schröder

Electron. J. Comb., 2022

Exact Matching in Graphs of Bounded Independence Number.

[BibT_eX]

[DOI]

Nicolas El Maalouly

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Edge Partitions of Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Zero sum cycles in complete digraphs.

[BibT_eX]

[DOI]

Tamás Mészáros

Eur. J. Comb., 2021

Edge Partitions of Complete Geometric Graphs (Part 2).

[BibT_eX]

[DOI]

CoRR, 2021

Majority Colorings of Sparse Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Flip Distances Between Graph Orientations.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

On the Average Complexity of the k-Level.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

A Note on Universal Point Sets for Planar Graphs.

[BibT_eX]

[DOI]

Manfred Scheucher

J. Graph Algorithms Appl., 2020

A Note on Graphs of Dichromatic Number 2.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

On the Complexity of Digraph Colourings and Vertex Arboricity.

[BibT_eX]

[DOI]

Felix Schröder

Discret. Math. Theor. Comput. Sci., 2020

A note on coloring digraphs of large girth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Complete Acyclic Colorings.

[BibT_eX]

[DOI]

Kolja Knauer

Electron. J. Comb., 2020

Parameterized Algorithms for Directed Modular Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Parametrised Algorithms for Directed Modular Width.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Equiangular Polygon Contact Representations.

[BibT_eX]

[DOI]

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

2017

Pentagon Contact Representations.

[BibT_eX]

[DOI]