How to Color a Graph

Publisher Website

1 January 1975

book chapter
Published by Springer Nature

p. 305-325
https://doi.org/10.1007/978-94-011-7557-9_16

Abstract

No abstract available

Keywords

This publication has 13 references indexed in Scilit:

Une classe d'hypergraphes bichromatiques II
Discrete Mathematics, 1974
Une classe d'hypergraphes bichromatiques
Discrete Mathematics, 1972
k-Components, Clusters and Slicings in Graphs
SIAM Journal on Applied Mathematics, 1972
Balanced matrices
Mathematical Programming, 1972
GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.
Published by Elsevier ,1972
Equitable colorations of graphs
Revue française d'informatique et de recherche opérationnelle. Série rouge, 1971
An inequality for the chromatic number of a graph
Journal of Combinatorial Theory, 1968
An upper bound for the chromatic number of a graph and its application to timetabling problems
The Computer Journal, 1967
An algorithm for a minimum cover of a graph
Proceedings of the American Mathematical Society, 1959
On colouring the nodes of a network
Mathematical Proceedings of the Cambridge Philosophical Society, 1941