Grundy coloring in some subclasses of bipartite graphs and their complements
From MaRDI portal
Publication:2203596
DOI10.1016/j.ipl.2020.105999zbMath1466.05079OpenAlexW3039714353MaRDI QIDQ2203596
Publication date: 7 October 2020
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2020.105999
Analysis of algorithms (68W40) 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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Results on the Grundy chromatic number of graphs
- Some perfect coloring properties of graphs
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- On the Grundy and \(b\)-chromatic numbers of a graph
- The game Grundy number of graphs
- On partial Grundy coloring of bipartite graphs and chordal graphs
- An algorithm for partial Grundy number on trees
- Edge Dominating Sets in Graphs
- The NP-Completeness of Edge-Coloring
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Interval bigraphs and circular arc graphs
- Algorithms and Computation
This page was built for publication: Grundy coloring in some subclasses of bipartite graphs and their complements