Jansen, Klaus Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Jansen, K. (1998). A New Characterization for Parity Graphs and a Coloring Problem with Costs. In C. L. Lucchesi, & A. V. Moura (Eds.), Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98) (pp. 249-260). Berlin, Germany: Springer.