Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree

Olivier Durand de Gévigney, Frédéric Meunier, Christian Popa, Julien Reygner, Ayrin Romero. Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree. 4OR, 9(2):175-188, 2011. [doi]

@article{GevigneyMPRR11,
  title = {Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree},
  author = {Olivier Durand de Gévigney and Frédéric Meunier and Christian Popa and Julien Reygner and Ayrin Romero},
  year = {2011},
  doi = {10.1007/s10288-010-0150-8},
  url = {http://dx.doi.org/10.1007/s10288-010-0150-8},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GevigneyMPRR11},
  cites = {0},
  citedby = {0},
  journal = {4OR},
  volume = {9},
  number = {2},
  pages = {175-188},
}