Complexity of Generalized Colourings of Chordal Graphs

@inproceedings{Fraser2008ComplexityOG,
  title={Complexity of Generalized Colourings of Chordal Graphs},
  author={Simon Fraser},
  year={2008}
}
The generalized graph colouring problem (GCOL) for a fixed integer k, and fixed classes of graphs P1, . . . ,Pk (usually describing some common graph properties), is to decide, for a given graph G, whether the vertex set of G can be partitioned into sets V1, . . . , Vk such that, for each i, the induced subgraph of G on Vi belongs to Pi. It can be seen that GCOL generalizes many natural colouring and partitioning problems on graphs. In this thesis, we focus on generalized colouring problems in… CONTINUE READING
3 Citations
59 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 59 references

Representation of a finite graph by a set of intervals on the real line

  • C. G. Lekkerkerker, J. C. Boland
  • Fundamenta Mathematicae
  • 1962
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…