On the Nash number and the diminishing Grundy number of a graph
From MaRDI portal
Publication:2127607
Recommendations
Cites work
- scientific article; zbMATH DE number 1286500 (Why is no real title available?)
- scientific article; zbMATH DE number 3800939 (Why is no real title available?)
- A Game Theoretic Approach for Efficient Graph Coloring
- A short proof that \(\chi\) can be bounded \(\epsilon\) away from \(\Delta + 1\) toward \(\omega\)
- Graph theory
- Grundy number and products of graphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On the list coloring version of Reed's conjecture
- On-line and first fit colorings of graphs
- Reducibility among combinatorial problems
- Results on the Grundy chromatic number of graphs
- Strategic coloring of a graph
- Sur le coloriage des graphs
- The NP-Completeness of Edge-Coloring
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
This page was built for publication: On the Nash number and the diminishing Grundy number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127607)