加载中…
2011-04-26
3-List Colouring Permutation Graphs
Jessica EnrightLorna Stewart
文献摘要
3-list colouring is an NP-complete decision problem. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving 3-list colouring on permutation graphs.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本