88 citations · 196 across the 39 of their papers we have counts for
4 papers · 2 filters
Rainbow cycles in flip graphs
Stefan Felsner, Linda Kleist, Torsten Mütze +1
The flip graph of triangulations has as vertices all triangulations of a convex -gon, and an edge between any two triangulations that differ in exactly one edge. An -rainbow…
Boolean dimension and tree-width
Stefan Felsner, Tamás Mészáros, Piotr Micek
The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if has dimension , then to know whether i…
Burling graphs, chromatic number, and orthogonal tree-decompositions
Stefan Felsner, Gwenaël Joret, Piotr Micek +2
A classic result of Asplund and Grünbaum states that intersection graphs of axis-aligned rectangles in the plane are -bounded. This theorem can be equivalently stated in terms o…
Separating Tree-chromatic number from Path-chromatic Number
Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros +4
We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~ while the path-chromatic number is unbounded. This resolves a…