Grundy coloring in some subclasses of bipartite graphs and their complements

Information Processing Letters（2020）

引用 1|浏览4

暂无评分

摘要

•NP-completeness of Grundy Coloring Decision Problem for Perfect Elimination Bipartite Graphs.•NP-completeness of Grundy Coloring Decision Problem for complements of Perfect Elimination Bipartite Graphs.•Linear time algorithm for finding an optimal Grundy coloring of chain graphs.•Linear time algorithm for finding an optimal Grundy coloring of complements of chain graphs.•NP-completeness of Partial Grundy Coloring Decision Problem in complements of Bipartite graphs.

查看译文

关键词

Graph algorithms,Grundy coloring,Partial Grundy coloring,NP-completeness,Polynomial time algorithms

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要