Author:
Ufuktepe Ünal,Bacak Goksen
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference25 articles.
1. Every planar map is four colorable I: Discharging;Appel;Illinois Journal Mathematics,1977
2. Chromatic polinomials;Birkhoff;Transactions American Mathematical Society,1946
3. On the complexity of some coloring games;Bodlaender;International Journal of Foundations of Computer Science,1991
4. Tenacity of complete graph products and grids;Choudum;Networks,1999
5. Authenticity and availability in PIPE networks;Cooper;Future Generation Computer Systems,2005
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献