Separators for Planar Graphs that are Almost Trees

08/08/2018
by   Linda Cai, et al.
0

We prove that a connected planar graph with n vertices and n+μ edges has a vertex separator of size O( √(μ) + 1), and this separator can be computed in linear time.

READ FULL TEXT

page 1

page 2

page 3

research
09/03/2021

Straight-line Drawings of 1-Planar Graphs

A graph is 1-planar if it can be drawn in the plane so that each edge is...
research
11/25/2019

Coloring outerplanar graphs and planar 3-trees with small monochromatic components

In this work, we continue the study of vertex colorings of graphs, in wh...
research
06/14/2022

The Maximum Linear Arrangement Problem for trees under projectivity and planarity

The Maximum Linear Arrangement problem (MaxLA) consists of finding a map...
research
02/04/2021

All Subgraphs of a Wheel are 5-Coupled-Choosable

A wheel graph consists of a cycle along with a center vertex connected t...
research
10/17/2018

Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time

We consider decomposing a 3-connected planar graph G using laminar separ...
research
10/12/2017

4-connected planar graphs are in B_3-EPG

We show that every 4-connected planar graph has a B_3-EPG representation...
research
02/27/2022

Enumeration of chordal planar graphs and maps

We determine the number of labelled chordal planar graphs with n vertice...

Please sign up or login with your details

Forgot password? Click here to reset