1. Lecture Notes in Computer Science;C. Bazgan,2003
2. Edmonds, J.: Paths, trees, and flowers. Canadian J. of Math 17, 449–467 (1965)
3. Gallai, T.: Maximale Systeme unabhängiger Kanten. Magyar Tud. Akad. Mat. Kutat ó Int. Közl. 9, 401–413 (1964)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979)
5. Gerber, M., Kobler, D.: Partitioning a graph to satisfy all vertices, Technical report, Swiss Federal Institute of Technology, Lausanne (1998)