Funder
National Science Foundation
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. On topological graphs with at most four crossings per edge;Ackerman,2015
2. The Probabilistic Method;Alon,2004
3. On the cutting edge: Simplified O(n) planarity by edge addition;Boyer;J. Graph Algorithms Appl.,2004
4. On colouring the nodes of a network;Brooks;Math. Proc. Camb. Phil. Soc.,1941
5. Adding one edge to planar graphs makes crossing number and 1-planarity hard;Cabello;SIAM J. Comput.,2013
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Testing gap k-planarity is NP-complete;Information Processing Letters;2021-08