5 citations · 7 across the 5 of their papers we have counts for
5 papers
On the interval coloring impropriety of graphs
MacKenzie Carr, Eun-Kyung Cho, Nicholas Crawford +3
An improper interval (edge) coloring of a graph is an assignment of colors to the edges of satisfying the condition that, for every vertex , the set of colors a…
Intersection Graphs of Maximal Sub-polygons of -Lizards
Caroline Daugherty, Joshua D. Laison, Rebecca Robinson +1
We introduce -maximal sub-polygon graphs (-MSP graphs), the intersection graphs of maximal polygons contained in a polygon with sides parallel to a regular -gon. We prove…
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…
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…
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…