Weakly and Strongly Fan-Planar Graphs

08/17/2023
by   Otfried Cheong, et al.
0

We study two notions of fan-planarity introduced by (Cheong et al., GD22), called weak and strong fan-planarity, which separate two non-equivalent definitions of fan-planarity in the literature. We prove that not every weakly fan-planar graph is strongly fan-planar, while the upper bound on the edge density is the same for both families.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2021

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees

The planar slope number psn(G) of a planar graph G is the minimum number...
research
04/09/2018

The Metric Space of Networks

We study the question of reconstructing a weighted, directed network up ...
research
09/12/2023

The maximum size of adjacency-crossing graphs

An adjacency-crossing graph is a graph that can be drawn such that every...
research
10/16/2022

Twin-width of Planar Graphs is at most 8, and at most 6 when Bipartite Planar

The structural parameter twin-width was introduced by Bonnet et al. in [...
research
05/29/2017

Power series expansions for the planar monomer-dimer problem

We compute the free energy of the planar monomer-dimer model. Unlike the...
research
03/07/2019

A face cover perspective to ℓ_1 embeddings of planar graphs

It was conjectured by Gupta et. al. [Combinatorica04] that every planar ...
research
02/22/2020

On Layered Fan-Planar Graph Drawings

In this paper, we study fan-planar drawings that use h layers and are pr...

Please sign up or login with your details

Forgot password? Click here to reset