EEMCS

Broersma, H.J. and Fomin, F.V. and Golovach, P.A. and Paulusma, D. (2009) Three Complexity Results on Coloring -Free Graphs. In: Combinatioral Algorithms - Proceedings of the 20th International Workshop , IWOCA 2009, June 28 - July 2 2009, Hradec nad Moravicí, Czech Republic. pp. 95-104. Lecture Notes in Computer Science 5874. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-10216-5

Broersma, H.J. and Fomin, F.V. and Golovach, P.A. and Woeginger, G.J. (2007) Backbone colorings for graphs: Tree and path backbones. Journal of graph theory, 55 (2). pp. 137-152. ISSN 0364-9024 *** ISI Impact 0,561 ***

Broersma, H.J. and Fomin, F.V. and Golovach, P.A. and Woeginger, G.J. (2003)
Backbone colorings for networks: tree and path backbones. Memorandum 1705, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690