Indexed metadata
The Chromatic Number of Graph Powers
NOGA ALON, BOJAN MOHAR
Source record
Source: Crossref
Published: Jan 1, 2002
DOI: 10.1017/s0963548301004965
Open original source ↗Source abstract
It is shown that the maximum possible chromatic number of the square of a graph with maximum degree d and girth g is (1 + o (1)) d 2 if g = 3, 4, 5 or 6, and is Θ( d 2 / log d ) if g [ges ] 7. Extensions to higher powers are considered as well.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.