On the Grundy number of Cameron graphs
From MaRDI portal
Publication:2413405
DOI10.1016/j.endm.2017.11.049zbMath1383.05100arXiv1604.07128OpenAlexW2963983426MaRDI QIDQ2413405
Fu-Hong Liu, Tao-Ming Wang, Wing-Kai Hon, Hsiang-Hsuan Liu, Ton Kloks
Publication date: 10 April 2018
Full work available at URL: https://arxiv.org/abs/1604.07128
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First-fit coloring on interval graphs has performance ratio at least 5
- Results on the Grundy chromatic number of graphs
- Algorithmic aspects of switch cographs
- A note on the online first-fit algorithm for coloring \(k\)-inductive graphs
- Some perfect coloring properties of graphs
- A lower estimate for the achromatic number of irreducible graphs
- Effective on-line coloring of \(P_ 5\)-free graphs
- Two-graphs and trees
- Counting two-graphs related to trees
- The complexity of harmonious colouring for trees
- Complexity of Grundy coloring and its variants
- Achromatic number is NP-complete for cographs and interval graphs
- On the Grundy and \(b\)-chromatic numbers of a graph
- Inequalities for the Grundy chromatic number of graphs
- On the equality of the grundy and ochromatic numbers of a graph
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- A new characterization of trivially perfect graphs
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
- A note on the Grundy number and graph products
This page was built for publication: On the Grundy number of Cameron graphs
