
handle: 11570/2066023
Bounds on the chromatic number of a graph in terms of its density are surveyed. The concepts of line-graph and of chromatic index are exploited. In turn, a sharpening of Vizing's Theorem ls exhibited. Additional conditions yield the chromatic class of the Generalized Petersen Graphs and of certain uniquely colourable graphs.
Graphs; Chromatic number; Chromatic index
Graphs; Chromatic number; Chromatic index
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
