Local chromatic number and topology - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Local chromatic number and topology

Abstract

The local chromatic number of a graph, introduced by Erdős et al., is the minimum number of colors that must appear in the closed neighborhood of some vertex in any proper coloring of the graph. This talk would like to survey some of our recent results on this parameter. We give a lower bound for the local chromatic number in terms of the lower bound of the chromatic number provided by the topological method introduced by Lovász. We show that this bound is tight in many cases. In particular, we determine the local chromatic number of certain odd chromatic Schrijver graphs and generalized Mycielski graphs. We further elaborate on the case of $4$-chromatic graphs and, in particular, on surface quadrangulations.
Fichier principal
Vignette du fichier
dmAE0172.pdf (128.94 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184436 , version 1 (14-08-2015)

Identifiers

Cite

Gábor Simonyi, Gábor Tardos. Local chromatic number and topology. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.375-378, ⟨10.46298/dmtcs.3447⟩. ⟨hal-01184436⟩

Collections

TDS-MACS
99 View
782 Download

Altmetric

Share

Gmail Facebook X LinkedIn More