Jump to navigation Jump to search
altermatic (not comparable)
- (mathematics) Describing a lower bound of a chromatic number of a graph
- 2015, Meysam Alishahi, Hossein Hajiabolhassan, “On The Chromatic Number of Matching Graphs”, in arXiv:
- In this paper, as a generalization of the well-known result of Schrijver about the chromatic number of Schrijver graphs, we determine the chromatic number of a large family of matching graphs by specifying their altermatic number.