Abstract
The rank-coloring conjecture essentially states that the rank of the adjacency matrix (vertex-vertex matrix) calculated over the real numbers r(G) is an upper bound for the chromatic number γ(G) of a graph G. This conjecture is suggested by the following propositions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Heidelberg
About this paper
Cite this paper
Van Nuffelen, C. (1992). Rank and Chromatic Number. In: Gaul, W., Bachem, A., Habenicht, W., Runge, W., Stahl, W.W. (eds) Operations Research Proceedings 1991. Operations Research Proceedings 1991, vol 1991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46773-8_108
Download citation
DOI: https://doi.org/10.1007/978-3-642-46773-8_108
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55410-3
Online ISBN: 978-3-642-46773-8
eBook Packages: Springer Book Archive