Jan 15, 2008 · This paper looks at the subgraph homeomorphism problem where the pattern graph is a wheel with six spokes. The main result is a theorem ...

Then either G has a W5-subdivision centred on v0, or G has a W5-subdivision centred on some vertex v1 of degree ≥ 6, with a rim of size at least 6. or v0 v0 v0.

This paper looks at the subgraph homeomorphism problem where the pattern graph is a wheel with six spokes. The main result is a theorem characterizing graphs ...

Jan 15, 2008 · Abstract The subgraph homeomorphism problem has been shown by Robertson and. Seymour to be polynomial-time solvable for any fixed pattern ...

Robinson, R. J., & Farr, G. E. (2009). Structure and recognition of graphs with no 6-wheel subdivision. Algorithmica, 55(4), 703 - 728. Robinson, Rebecca Jane ; ...

Rebecca Robinson , Graham Farr: Structure and Recognition of Graphs with No 6-wheel Subdivision. Algorithmica 55(4): 703-728 (2009). manage site settings.

Structure and Recognition of Graphs with No 6-wheel Subdivision. Rebecca Robinson Graham Farr. Published in: Algorithmica (2009). Keyphrases.

This paper examines the topological containment problem where the pattern graph is a wheel with seven spokes, and gives a result that describes graphs with no W ...

Structure and recognition of graphs with no 6-wheel subdivision. Published online in Algorithmica, January 2008; awaiting print publication. [6] Rebecca ...