73 citations · 387 across the 61 of their papers we have counts for
4 papers · 2 filters
Every Collinear Set in a Planar Graph Is Free
Vida Dujmović, Fabrizio Frati, Daniel Gonçalves +2
We show that if a planar graph has a plane straight-line drawing in which a subset of its vertices are collinear, then for any set of points, , in the plane with $|X|=|S…
Dual Circumference and Collinear Sets
Vida Dujmović, Pat Morin
We show that, if a -vertex triangulation of maximum degree has a dual that contains a cycle of length , then has a non-crossing straight-line drawing in which…
Minor-closed graph classes with bounded layered pathwidth
Vida Dujmović, David Eppstein, Gwenaël Joret +2
We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour,…
Anagram-Free Chromatic Number is not Pathwidth-Bounded
Paz Carmi, Vida Dujmović, Pat Morin
The anagram-free chromatic number is a new graph parameter introduced independently Kamčev, Łuczak, and Sudakov (2017) and Wilson and Wood (2017). In this note, we show that there…