Coloring Powers of Graphs of Bounded Clique-Width
暂无分享,去创建一个
[1] Xiao Zhou,et al. Generalized Vertex-Colorings of Partial K-Trees , 2000 .
[2] Udi Rotics,et al. Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract) , 2001, SODA '01.
[3] Egon Wanke,et al. How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time , 2001, WG.
[4] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[5] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .