On the Grundy number of graphs with few ’s
- 1 December 2012
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 160 (18) , 2514-2522
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Results on the Grundy chromatic number of graphsDiscrete Mathematics, 2006
- Algorithms for Vertex Partitioning Problems on Partial k-TreesSIAM Journal on Discrete Mathematics, 1997
- A coloring problem for weighted graphsInformation Processing Letters, 1997
- P4-laden graphs: A new class of brittle graphsInformation Processing Letters, 1996
- On‐line and first fit colorings of graphsJournal of Graph Theory, 1988
- Four classes of perfectly orderable graphsJournal of Graph Theory, 1987
- The splittance of a graphCombinatorica, 1981
- Reducibility among Combinatorial Problems1972