Geometric Graphs with Unbounded Flip-Width
Computational Geometry
2023-06-23 v1 Combinatorics
Abstract
We consider the flip-width of geometric graphs, a notion of graph width recently introduced by Toru\'nczyk. We prove that many different types of geometric graphs have unbounded flip-width. These include interval graphs, permutation graphs, circle graphs, intersection graphs of axis-aligned line segments or axis-aligned unit squares, unit distance graphs, unit disk graphs, visibility graphs of simple polygons, -skeletons, 4-polytopes, rectangle of influence graphs, and 3d Delaunay triangulations.
Keywords
Cite
@article{arxiv.2306.12611,
title = {Geometric Graphs with Unbounded Flip-Width},
author = {David Eppstein and Rose McCarty},
journal= {arXiv preprint arXiv:2306.12611},
year = {2023}
}
Comments
10 pages, 7 figures. To appear at CCCG 2023