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.
On the density, chromatic number and chromatic index of a graph
LO FARO, Giovanni;PUCCIO, Luigia
1991-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
