New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes

Ganian, Robert; Hlinený, Petr

by Robert Ganian, Petr Hlinený

Reference:

New Results on the Complexity of Oriented Colouring on Restricted Digraph ClassesRobert Ganian, Petr HlinenýSOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings, volume 5901 of Lecture Notes in Computer Science, pages 428–439, 2010, Springer Verlag.

Bibtex Entry:

@string{springer="Springer Verlag"}
@inproceedings{GanianHlineny10,
  author    = {Robert Ganian and
               Petr Hlinen{\'{y}}},
  title     = {New Results on the Complexity of Oriented Colouring on Restricted
               Digraph Classes},
  booktitle = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
               on Current Trends in Theory and Practice of Computer Science, Spindleruv
               Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
  pages     = {428--439},
  year      = {2010},
  volume    = {5901},
  series    = {Lecture Notes in Computer Science},
  publisher = {Springer}  
}