The following pages link to Christopher Purcell (Q742579):
Displaying 11 items.
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
- Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
- Role colouring graphs in hereditary classes (Q2034782) (← links)
- On exclusive sum labellings of hypergraphs (Q2115164) (← links)
- Subgraph complementation and minimum rank (Q2121776) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
- Boundary properties of the satisfiability problems (Q2450928) (← links)
- LCL Problems on Grids (Q5368949) (← links)
