Role colouring graphs in hereditary classes

@article{Purcell2021RoleCG,
  title={Role colouring graphs in hereditary classes},
  author={C. Purcell and M. P. Rombach},
  journal={Theor. Comput. Sci.},
  year={2021},
  volume={876},
  pages={12-24}
}
We study the computational complexity of computing role colourings of graphs in hereditary classes. We are interested in describing the family of hereditary classes on which a role colouring with k colours can be computed in polynomial time. In particular, we wish to describe the boundary between the "hard" and "easy" classes. The notion of a boundary class has been introduced by Alekseev in order to study such boundaries. Our main results are a boundary class for the k-role colouring problem… Expand

References

SHOWING 1-10 OF 25 REFERENCES
On the complexity of role colouring planar graphs, trees and cographs
On easy and hard hereditary classes of graphs with respect to the independent set problem
Coupon coloring of some special graphs
Boundary properties of graphs for algorithmic graph problems
Total k-Domatic Partition on Some Classes of Graphs
  • C. Lee
  • Computer Science
  • 2016 International Computer Symposium (ICS)
  • 2016
On coupon colorings of graphs
A new series of dense graphs of high girth
Coupon coloring of cographs
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree
Constructions for Cubic Graphs with Large Girth
  • N. Biggs
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 1998
...
1
2
3
...