An Algebraic Characterization of Rainbow Connectivity

Details An Algebraic Characterization of Rainbow Connectivity An Algebraic Characterization of Rainbow Connectivity

2011-09-11

arxiv.org/abs/1109.2291v1

Computer Science

Discrete Mathematics

Scientific paper

The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also give a formulation of the rainbow connectivity problem as an ideal membership problem.

Affiliated with

Also associated with

No associations

Rating

An Algebraic Characterization of Rainbow Connectivity 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 An Algebraic Characterization of Rainbow Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algebraic Characterization of Rainbow Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19960