A New Vertex Coloring Heuristic and Corresponding Chromatic Number
- 21 February 2020
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 82 (9) , 2395-2414
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- A characterization of b-chromatic and partial Grundy numbers by induced subgraphsDiscrete Mathematics, 2016
- On the Grundy and b-Chromatic Numbers of a GraphAlgorithmica, 2011
- A survey on vertex coloring problemsInternational Transactions in Operational Research, 2009
- Results on the Grundy chromatic number of graphsDiscrete Mathematics, 2006
- The b-chromatic number of a graphDiscrete Applied Mathematics, 1999
- Exploring the k-colorable landscape with iterated greedy1996
- The greedy algorithm is optimal for on-line edge coloringInformation Processing Letters, 1992
- An Analysis of a Good Algorithm for the Subtree Problem, CorrectedSIAM Journal on Computing, 1989
- On‐line and first fit colorings of graphsJournal of Graph Theory, 1988
- New methods to color the vertices of a graphCommunications of the ACM, 1979