Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs

DOI10.1007/978-3-319-64419-6_30zbMath1494.68203OpenAlexW2747041685MaRDI QIDQ1683560

B. S. Panda, Shaily Verma

Publication date: 1 December 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-64419-6_30

zbMATH Keywords

NP-completenesspolynomial-time algorithmsperfect elimination bipartite graphspartial Grundy coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On partial Grundy coloring of bipartite graphs and chordal graphs

This page was built for publication: Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs