On the Nash number and the diminishing Grundy number of a graph
From MaRDI portal
Publication:2127607
DOI10.1016/j.dam.2022.02.025zbMath1487.05093OpenAlexW4220817013MaRDI QIDQ2127607
Allen Ibiapina, Leonardo Rocha, Frédéric Havet
Publication date: 20 April 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.02.025
Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the Grundy chromatic number of graphs
- Grundy number and products of graphs
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- On the list coloring version of Reed's conjecture
- A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω
- Strategic Coloring of a Graph
- A Game Theoretic Approach for Efficient Graph Coloring
- On-line and first fit colorings of graphs
- The NP-Completeness of Edge-Coloring
- Reducibility among Combinatorial Problems
- Sur le coloriage des graphs
This page was built for publication: On the Nash number and the diminishing Grundy number of a graph
