Winding number and circular 4-coloring of (signed) graphs - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Winding number and circular 4-coloring of (signed) graphs

Résumé

Concerning the recent notion of circular chromatic number of signed graphs, we introduce a bipartite analogue of the generalized Mycielski graphs, denoted BM k,2k−1 , having the following properties. It has k(2k − 1) + 1 vertices, its shortest negative cycle is of length 2k and its circular chromatic number is 4. In the course of proving our result, we also obtain a simpler proof of the fact that the generalized Mycielski graph M ℓ (C 2k+1) has circular chromatic number 4. The proof has the advantage that it illuminates, in an elementary manner, the strong relation between algebraic topology and graph coloring problems.
Fichier principal
Vignette du fichier
Generalized Mycielski 1Nov 2022.pdf (319.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03840738 , version 1 (06-11-2022)
hal-03840738 , version 2 (08-07-2023)

Identifiants

  • HAL Id : hal-03840738 , version 1

Citer

Reza Naserasr. Winding number and circular 4-coloring of (signed) graphs. 2022. ⟨hal-03840738v1⟩
53 Consultations
96 Téléchargements

Partager

Gmail Facebook X LinkedIn More