Vectorial solutions to list multicoloring problems on graphs

Details Vectorial solutions to list multicoloring problems on graphs Vectorial solutions to list multicoloring problems on graphs

2012-02-22

arxiv.org/abs/1202.4842v1

Mathematics

Combinatorics

10 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Vectorial solutions to list multicoloring problems on graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vectorial solutions to list multicoloring problems on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vectorial solutions to list multicoloring problems on graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-414746