Paper Info
Title
Grundy coloring in some subclasses of bipartite graphs and their complements
Abstract
•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.
Year
DOI
Venue
2020
10.1016/j.ipl.2020.105999
Information Processing Letters
Keywords
DocType
Volume
Graph algorithms,Grundy coloring,Partial Grundy coloring,NP-completeness,Polynomial time algorithms
Journal
163
ISSN
Citations 
PageRank 
0020-0190
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Shaily Verma100.34
B. S. Panda29921.18