On partial Grundy coloring of bipartite graphs and chordal graphs
type: Item
instance of: scholarly article
title: On partial Grundy coloring of bipartite graphs and chordal graphs
zbMATH Open document ID: 1428.05114
author: B. S. Panda
author: Shaily Verma
published in: Discrete Applied Mathematics
publication date: 2019-11-27T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7136952
zbMATH Keywords: partial Grundy coloring
zbMATH Keywords: perfect elimination bipartite graphs
zbMATH Keywords: star-convex bipartite graphs
zbMATH Keywords: chordal graphs
zbMATH Keywords: NP-completeness
zbMATH Keywords: polynomial time algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2019.08.005
OpenAlex ID: W2970471953
cites work: Interpolation theorem for partial Grundy coloring
cites work: Dually Chordal Graphs
cites work: Some perfect coloring properties of graphs
cites work: On the equality of the partial Grundy and upper ochromatic numbers of graphs
cites work: Incidence matrices and interval graphs
cites work: Some simplified NP-complete graph problems
cites work: Perfect Elimination and Chordal Bipartite Graphs
cites work: Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs
cites work: An algorithm for partial Grundy number on trees
cites work: Algorithms and Computation
cites work: A REVIEW OF TREE CONVEX SETS TEST
DOI: 10.1016/J.DAM.2019.08.005
description: scientific article; zbMATH DE number 7136952