5 citations · 7 across the 5 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2017
Topological containment of the 5-clique minus an edge in 4-connected graphs
Rebecca Robinson, Graham Farr
The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph , but good characterisations have been found for only a handful of non-tr…
cs.DM2013★ 5 cited
Graphs with no 7-wheel subdivision
Rebecca Robinson, Graham Farr
The subgraph homeomorphism problem, SHP(), has been shown to be polynomial-time solvable for any fixed pattern graph , but practical algorithms have been developed only for a…
cs.DM2013★ 1 cited
Search strategies for developing characterizations of graphs without small wheel subdivisions
Rebecca Robinson, Graham Farr
Practical algorithms for solving the Subgraph Homeomorphism Problem are known for only a few small pattern graphs: among these are the wheel graphs with four, five, six, and seven…