Christopher Purcell

Orcid: 0000-0001-9869-1097

According to our database1, Christopher Purcell authored at least 14 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph.
CoRR, 2023

2022
On Exclusive Sum Labellings of Hypergraphs.
Graphs Comb., 2022

Subgraph Complementation and Minimum Rank.
Electron. J. Comb., 2022

The parameterized complexity of manipulating Top Trading Cycles.
Auton. Agents Multi Agent Syst., 2022

2021
Role colouring graphs in hereditary classes.
Theor. Comput. Sci., 2021

2017
Distributed Colour Reduction Revisited.
CoRR, 2017

LCL Problems on Grids.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2015
On the complexity of role colouring planar graphs, trees and cographs.
J. Discrete Algorithms, 2015

Independent domination in finitely defined classes of graphs: Polynomial algorithms.
Discret. Appl. Math., 2015

2014
Dominating induced matchings in graphs without a skew star.
J. Discrete Algorithms, 2014

Coloring vertices of claw-free graphs in three colors.
J. Comb. Optim., 2014

Graphs Without Large Apples and the Maximum Weight Independent Set Problem.
Graphs Comb., 2014

2013
Boundary properties of the satisfiability problems.
Inf. Process. Lett., 2013

Sparse regular induced subgraphs in 2P<sub>3</sub>-free graphs.
Discret. Optim., 2013


  Loading...