Vectorial solutions to list multicoloring problems on graphs

Abstract : 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.
Keywords :
Type de document :
Article dans une revue
Advances and Applications in Discrete Mathematics, Pushpa Publishing House, 2012, Volume 9 (Numéro 2), pp 65 --81
Domaine :

https://hal.archives-ouvertes.fr/hal-00672373
Contributeur : Yves Aubry <>
Soumis le : mardi 21 février 2012 - 10:44:58
Dernière modification le : lundi 4 avril 2016 - 14:45:02
Document(s) archivé(s) le : mardi 22 mai 2012 - 02:22:00

Fichiers

ChannelAssignmentPaper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

• HAL Id : hal-00672373, version 1
• ARXIV : 1202.4842

Citation

Yves Aubry, Jean-Christophe Godin, Olivier Togni. Vectorial solutions to list multicoloring problems on graphs. Advances and Applications in Discrete Mathematics, Pushpa Publishing House, 2012, Volume 9 (Numéro 2), pp 65 --81. <hal-00672373>

Consultations de
la notice

298

Téléchargements du document