Author:
Biedl Therese,Demaine Erik D.,Duncan Christian A.,Fleischer Rudolf,Kobourov Stephen G.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. C. Berge. Two theorems in graph theory. Proc. Nat. Acad. Sci. U. S. A., 43:842–844, 1957. 311
2. T. Biedl, P. Bose, E. Demaine, and A. Lubiw. Effcient algorithms for Petersen’s theorem. J. Algorithms, 38:110–134, 2001.
3. J. Bondy and U. Murty. Graph Theory and Applications. Amerian Elsevier Publishing Co., 1976.
4. R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(E logD) time. Technical Report TR1999-792, Department of Computer Science, New York University, September 1999.
5. Lect Notes Comput Sci;C. Duncan,1999
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximum Neighbour Voronoi Games;WALCOM: Algorithms and Computation;2009