The Rank-Width of Edge-Coloured Graphs

@article{Kant2012TheRO,
  title={The Rank-Width of Edge-Coloured Graphs},
  author={Mamadou Moustapha Kant{\'e} and Micha{\"e}l Rao},
  journal={Theory of Computing Systems},
  year={2012},
  volume={52},
  pages={599-644}
}
A C-coloured graph is a graph, that is possibly directed, where the edges are coloured with colours from the set C. Clique-width is a complexity measure for C-coloured graphs, for finite sets C. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and structural properties. It is in particular related to the vertex-minor relation. We discuss some possible extensions of the notion of rank-width to C-coloured graphs. There is not a unique natural notion of… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

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

Similar Papers

Loading similar papers…