加载中…
2011-05-13
5-choosability of graphs with 2 crossings
Victor CamposFrédéric Havet
文献摘要
We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本