AI Chat AI Image Generator AI Video Text to Speech

All minor-minimal apex obstructions with connectivity two

08/17/2018

∙

by Adam S. Jobson, et al.

∙

∙

A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of determining this finite list of apex obstructions remains open. This paper determines the 133 minor-minimal, non-apex graphs that have connectivity two.

Adam S. Jobson
1 publication
André E. Kézdy
2 publications

page 1

page 2

page 3

page 4

research

∙ 03/01/2021

k-apices of minor-closed graph classes. I. Bounding the obstructions

Let G be a minor-closed graph class. We say that a graph G is a k-apex o...

0 Ignasi Sau, et al. ∙

research

∙ 07/05/2019

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

For a finite collection of graphs F, the F-TM-Deletion problem has as ...

0 Petr A. Golovach, et al. ∙

research

∙ 04/04/2023

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem

An infinite graph is quasi-transitive if its vertex set has finitely man...

0 Louis Esperet, et al. ∙

research

∙ 10/05/2021

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size

In the ℱ-Minor-Free Deletion problem one is given an undirected graph G,...

0 Huib Donkers, et al. ∙

research

∙ 04/27/2020

An FPT-algorithm for recognizing k-apices of minor-closed graph classes

Let G be a graph class. We say that a graph G is a k-apex of G if G cont...

0 Ignasi Sau, et al. ∙

research

∙ 03/02/2021

Block Elimination Distance

We introduce the block elimination distance as a measure of how close a ...

0 Öznur Yaşar Diner, et al. ∙

research

∙ 09/02/2023

Characterising 4-tangles through a connectivity property

Every large k-connected graph-minor induces a k-tangle in its ambient gr...

0 Johannes Carmesin, et al. ∙