A note on mixed tree coloring

  • Authors:

  • Hanna Furmańczyk;Adrian Kosowski;Paweł Żyliński

  • Affiliations:

  • Institute of Computer Science, University of Gdańsk, 80-952 Gdańsk, Poland;Department of Algorithms and System Modeling, Gdańsk University of Technology, 80-952 Gdańsk, Poland;Institute of Computer Science, University of Gdańsk, 80-952 Gdańsk, Poland

  • Venue:
  • Information Processing Letters
  • Year:
  • 2008

Quantified Score

Hi-index 0.89

Visualization

Abstract

In this note we observe that the problem of mixed graph coloring can be solved in linear time for trees, which improves the quadratic algorithm of Hansen et al. [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].