Complexity of Grundy coloring and its variants
Authors:
- Édouard BonnetÉBÉdouard Bonnet
- Florent FoucaudFFFlorent Foucaud
- Eun Jung KimEKEun Jung Kim
- Florian SikoraFSFlorian Sikora
- 1 July 2018
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 243, 99-114
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Known Algorithms for Edge Clique Cover are Probably OptimalSIAM Journal on Computing, 2016
- On the Grundy number of graphs with few ’sDiscrete Applied Mathematics, 2012
- First-fit chromatic numbers of -degenerate graphsDiscrete Mathematics, 2012
- Combinatorial bounds via measure and conquerACM Transactions on Algorithms, 2008
- Fixed-Parameter Tractability, Definability, and Model-CheckingSIAM Journal on Computing, 2001
- Diameter and Treewidth in Minor-Closed Graph FamiliesAlgorithmica, 2000
- On-line 3-chromatic graphs - II critical graphsDiscrete Mathematics, 1997
- Color-codingJournal of the ACM, 1995
- On the equality of the grundy and ochromatic numbers of a graphJournal of Graph Theory, 1987
- Some perfect coloring properties of graphsJournal of Combinatorial Theory, Series B, 1979