Author:
Bannister Michael J.,Cabello Sergio,Eppstein David
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Akutsu, T., Hayashida, M., Ching, W.-K., Ng, M.K.: Control of Boolean networks: Hardness results and algorithms for tree structured networks. J. Theor. Biol. 244(4), 670–679 (2007), doi:10.1016/j.jtbi.2006.09.023
2. Borodin, O.V.: Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs. Metody Diskret. Analiz. (41), 12–26, 108 (1984)
3. Lecture Notes in Computer Science;F.J. Brandenburg,2013
4. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. CoRR abs/1203.5944 (2012)
5. Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoretical Computer Science 411(40-42), 3736–3756 (2010), doi:10.1016/j.tcs.2010.06.026
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献