Geometric Graphs with Unbounded Flip-Width

06/22/2023
by   David Eppstein, et al.
0

We consider the flip-width of geometric graphs, a notion of graph width recently introduced by Toruńczyk. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/01/2022

Twin-width VIII: delineation and win-wins

We introduce the notion of delineation. A graph class 𝒞 is said delineat...
research
01/23/2023

Functionality of box intersection graphs

Functionality is a graph complexity measure that extends a variety of pa...
research
02/25/2022

Twin-width and Transductions of Proper k-Mixed-Thin Graphs

The new graph parameter twin-width, recently introduced by Bonnet, Kim, ...
research
09/08/2017

Balanced Line Separators of Unit Disk Graphs

We prove a geometric version of the graph separator theorem for the unit...
research
02/19/2020

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited

Interval graphs, intersection graphs of segments on a real line (interva...
research
06/19/2017

Combinatorial Properties and Recognition of Unit Square Visibility Graphs

Unit square (grid) visibility graphs (USV and USGV, resp.) are described...
research
12/14/2021

Hop-Spanners for Geometric Intersection Graphs

A t-spanner of a graph G=(V,E) is a subgraph H=(V,E') that contains a uv...

Please sign up or login with your details

Forgot password? Click here to reset