加载中…
2013-09-11
On the Crossing Number of Complete Graphs with an Uncrossed Hamiltonian Cycle
Daniel M. Kane
文献摘要
We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本