On partial Grundy coloring of bipartite graphs and chordal graphs

DOI10.1016/j.dam.2019.08.005zbMath1428.05114OpenAlexW2970471953MaRDI QIDQ2009016

B. S. Panda, Shaily Verma

Publication date: 27 November 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.08.005

zbMATH Keywords

NP-completenesschordal graphspolynomial time algorithmsperfect elimination bipartite graphspartial Grundy coloringstar-convex bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Grundy coloring in some subclasses of bipartite graphs and their complements

Cites Work

• Some perfect coloring properties of graphs
• Some simplified NP-complete graph problems
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs
• Interpolation theorem for partial Grundy coloring
• Incidence matrices and interval graphs
• An algorithm for partial Grundy number on trees
• Perfect Elimination and Chordal Bipartite Graphs
• Dually Chordal Graphs
• A REVIEW OF TREE CONVEX SETS TEST
• Algorithms and Computation

This page was built for publication: On partial Grundy coloring of bipartite graphs and chordal graphs