Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Frequency planning and ramifications of coloring;Eisenblätter;Discussiones Mathematicae Graph Theory,2002
2. K. Giaro, The computational complexity of the T-coloring problem and its dependence on graphs’ degrees, Technical Report 34/99, Gdańsk University of Technology (in Polish)
3. The complexity of T-coloring problem for graphs with small degree;Giaro;Discrete Applied Mathematics,2003
4. A polynomial algorithm for finding T-span of generalized cacti;Giaro;Discrete Applied Mathematics,2003
5. Frequency assignment: Theory and applications;Hale;Proceeding of the IEEE,1980
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献