Monotone Arc Diagrams with few Biarcs

03/11/2020
by   Steven Chaplick, et al.
0

We show that every planar graph can be represented by a monotone topological 2-page book embedding where at most 15n/16 (of potentially 3n-6) edges cross the spine exactly once.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2020

Four Pages Are Indeed Necessary for Planar Graphs

An embedding of a graph in a book consists of a linear order of its vert...
research
03/17/2020

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages

An embedding of a graph in a book, called book embedding, consists of a ...
research
08/07/2021

SpEuler: Semantics-preserving Euler Diagrams

Creating comprehensible visualizations of highly overlapping set-typed d...
research
03/27/2018

On Dispersable Book Embeddings

In a dispersable book embedding, the vertices of a given graph G must be...
research
08/21/2015

Representation of Quasi-Monotone Functionals by Families of Separating Hyperplanes

We characterize when the level sets of a continuous quasi-monotone funct...
research
08/22/2017

Upward Partitioned Book Embeddings

We analyze a directed variation of the book embedding problem when the p...
research
07/05/2018

Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness

We investigate the problem #IndSub(Φ) of counting all induced subgraphs ...

Please sign up or login with your details

Forgot password? Click here to reset