|
Zapiski Nauchnykh Seminarov POMI, 2002, Volume 293, Pages 5–25
(Mi znsl1673)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Systems of pair of $q$-distant representatives and graph colorings
P. A. Golovach Syktyvkar State University
Abstract:
NP-completeness of a number of graph coloring problems connected with the frequency assignment problem is proved. For this purpose we introduce problems concerning systems of pairs of $q$-distant representatives (related to the well known problem about the system of distinct representatives, but being NP-complete for $q\ge2$), which turned out to be convenient for proving NP-completeness of various graph coloring problems.
Received: 12.12.2002
Citation:
P. A. Golovach, “Systems of pair of $q$-distant representatives and graph colorings”, Computational complexity theory. Part VII, Zap. Nauchn. Sem. POMI, 293, POMI, St. Petersburg, 2002, 5–25; J. Math. Sci. (N. Y.), 126:3 (2005), 1141–1151
Linking options:
https://www.mathnet.ru/eng/znsl1673 https://www.mathnet.ru/eng/znsl/v293/p5
|
|