Consecutive colorings of graphs
- 1 January 1988
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 32 (1) , 1-8
- https://doi.org/10.1007/bf01920567
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A note on strong perfectness of graphsMathematical Programming, 1985
- Smallest-last ordering and clustering and graph coloring algorithmsJournal of the ACM, 1983
- Perfect GraphsPublished by Elsevier ,1980
- An inequality for the chromatic number of a graphJournal of Combinatorial Theory, 1968
- An upper bound for the chromatic number of a graph and its application to timetabling problemsThe Computer Journal, 1967