The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degree - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2019

The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degree

Fabien Jacques
Mickaël Montassier

Abstract

The notion of homomorphisms of 2-edge-colored graphs has already been studied as a way of extending classical results in graph coloring such as Hadwiger’s conjecture. Guenin [5] introduced the notion of switching homomorphisms for its relation with a well-known conjecture of Seymour. In 2012, this notion has been further developed by Naserasr et al. [6] as it captures a number of well-known conjectures that can be reformulated using the definition of switching homomorphisms. In this extended abstract, we study homomorphisms of 2-edge colored graphs and switching homomorphisms of bounded degree graphs.
Fichier principal
Vignette du fichier
jmp19.pdf (205.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-02938635 , version 1 (03-10-2023)

Identifiers

  • HAL Id : lirmm-02938635 , version 1

Cite

Fabien Jacques, Mickaël Montassier, Alexandre Pinlou. The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degree. BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France. ⟨lirmm-02938635⟩
77 View
1 Download

Share

Gmail Facebook X LinkedIn More