Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor

A graph \(G\) contains a graph \(H\) as an induced minor if \(H\) can be obtained from \(G\) after vertex deletions and edge contractions. We show that for every \(k\)-vertex planar graph \(H\), every graph \(G\) excluding \(H\) as an induced minor and \(K_{t,t}\) as a subgraph has treewidth at most...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-07
Hauptverfasser:	Bonnet, Édouard, Hodor, Jędrzej, Korhonen, Tuukka, Masařík, Tomáš
Format:	Artikel
Sprache:	eng
Schlagworte:	Graphs Polynomials Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!