Drawing disconnected graphs on the Klein bottle
英文摘要:
We prove that two disjoint graphs must always be drawn separately on the Klein bottle, in order to minimize the crossing number of the whole drawing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
We prove that two disjoint graphs must always be drawn separately on the Klein bottle, in order to minimize the crossing number of the whole drawing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。