Graphs with no 7-wheel subdivision

The topological containment problem, TC(H), has been shown to be polynomial-time solvable for any fixed pattern graph H, but practical algorithms have been developed only for a few specific pattern graphs. Among these are the wheels with four, five, and six spokes. This paper examines the topologica...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics 2014-07, Vol.327, p.9-28
Hauptverfasser:	Robinson, Rebecca, Farr, Graham
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Containment Graph characterization Graph subdivision Graphs Mathematical analysis Spokes Subdivisions Topological containment Topology Wheels
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!