Graphs with no 7-wheel subdivision

Abstract 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 topological containment problem where the pattern graph is a wheel with seven spokes, and gives a result that describes graphs with no W 7 -subdivision, showing how they can be built up, using certain operations, from smaller ‘pieces’ that meet certain conditions. We also discuss algorithmic aspects of the problem.

[1]  W. Sierpinski,et al.  Sur le probléme des courbes gauches en Topologie , 2022 .

[2]  John Maharry.  A Characterization of Graphs with No Cube Minor , 2000, J. Comb. Theory, Ser. B.

[3]  Michael R. Fellows,et al.  An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..

[4]  D. W. Hall.  A note on primitive skew curves , 1943 .

[5]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[6]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[7]  Dániel Marx,et al.  Structure theorem and isomorphism test for graphs with excluded topological subgraphs , 2011, STOC '12.

[8]  Paul Wollan,et al.  Finding topological subgraphs is fixed-parameter tractable , 2010, STOC.

[9]  G. Dirac.  A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs , 1952 .

[10]  Graham Farr.  The subgraph homeomorphism problem for small wheels , 1988, Discret. Math..

[11]  Graham Farr,et al.  Structure and Recognition of Graphs with No 6-wheel Subdivision , 2009, Algorithmica.

[12]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[13]  Graham Farr,et al.  Search strategies for developing characterizations of graphs without small wheel subdivisions , 2013, ArXiv.

[14]  Neil Robertson,et al.  Disjoint Paths—A Survey , 1985 .

[15]  B. Mohar,et al.  Graph Minors , 2009 .

[16]  R. Duffin.  Topology of series-parallel networks , 1965 .

[17]  Dániel Marx,et al.  Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs , 2015, SIAM J. Comput..

[18]  Robin Thomas,et al.  Generating Internally Four-Connected Graphs , 2002, J. Comb. Theory, Ser. B.

[19]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.