Vectorial solutions to list multicoloring problems on graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Advances and Applications in Discrete Mathematics Année : 2012

Vectorial solutions to list multicoloring problems on graphs

Résumé

For a graph $G$ with a given list assignment $L$ on the vertices, we give an algebraical description of the set of all weights $w$ such that $G$ is $(L,w)$-colorable, called permissible weights. Moreover, for a graph $G$ with a given list $L$ and a given permissible weight $w$, we describe the set of all $(L,w)$-colorings of $G$. By the way, we solve the {\sl channel assignment problem}. Furthermore, we describe the set of solutions to the {\sl on call problem}: when $w$ is not a permissible weight, we find all the nearest permissible weights $w'$. Finally, we give a solution to the non-recoloring problem keeping a given subcoloring.
Fichier principal
Vignette du fichier
ChannelAssignmentPaper.pdf (145.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00672373 , version 1 (21-02-2012)

Identifiants

Citer

Yves Aubry, Jean-Christophe Godin, Olivier Togni. Vectorial solutions to list multicoloring problems on graphs. Advances and Applications in Discrete Mathematics, 2012, 9 (2), pp.65 --81. ⟨hal-00672373⟩
365 Consultations
113 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More