Author:
Deolalikar Vinay,Mesarina Malena,Recker John,Pradhan Salil
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Brooks, R.: On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37, 194–197 (1941)
2. Lecture Notes in Computer Science;V. Deolalikar,2005
3. Edwards, C.: Some extremal properties of bipartite subgraphs. Canad. J. Math. 3, 475–485 (1973)
4. Engels, D.: The Reader Collision Problem, Technical Report, Available at:
http://www.autoidcenter.org/research/MIT-AUTOID-WH-007.pdf
5. Erdös, P.: On some extremal problems in graph theory. Israel J. Math. 3, 113–116 (1965)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献