Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time

02/07/2023
by   Antoine Amarilli, et al.
0

In this note, we give a proof of the fact that we can efficiently find degree-3 planar graphs as topological minors of sufficiently large wall graphs. The result is needed as an intermediate step to fix a proof in my PhD thesis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2019

A note on 1-planar graphs with minimum degree 7

It is well-known that 1-planar graphs have minimum degree at most 7, and...
research
08/31/2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar

A simple topological graph is k-quasiplanar (k≥ 2) if it contains no k p...
research
01/03/2022

On Optimal Beyond-Planar Graphs

A graph is beyond-planar if it can be drawn in the plane with a specific...
research
02/26/2020

Finding large matchings in 1-planar graphs of minimum degree 3

A matching is a set of edges without common endpoint. It was recently sh...
research
09/25/2017

Topological directions in Cops and Robbers

We present the first survey of its kind on results at the intersection o...
research
10/27/2018

An algorithmically random family of MultiAspect Graphs and its topological properties

This article presents a theoretical investigation of incompressibility a...
research
10/14/2021

A Flat Wall Theorem for Matching Minors in Bipartite Graphs

A major step in the graph minors theory of Robertson and Seymour is the ...

Please sign up or login with your details

Forgot password? Click here to reset