Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Crossing-free subgraphs;Ajtai,1982
2. Compactness results in extremal graph theory;Erdős;Combinatorica,1982
3. Planar separators and the Euclidean norm;Gazit,1990
4. Complexity Issues in VLSI;Leighton,1983
5. New lower bound techniques for VLSI;Leighton;Math. Systems Theory,1984
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improvement on the Crossing Number of Crossing-Critical Graphs;Discrete & Computational Geometry;2020-12-18
2. The crossing number of K5,n+1∖e;Applied Mathematics and Computation;2020-07
3. Improvement on the Crossing Number of Crossing-Critical Graphs;Lecture Notes in Computer Science;2020
4. On the Decay of Crossing Numbers of Sparse Graphs;Journal of Graph Theory;2014-12-19
5. Crossing Numbers;Discrete Mathematics and Its Applications;2013-11-26