Paper Info
Title
An algebraic characterization of rainbow connectivity
Abstract
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 present a formulation of the rainbow connectivity problem as an ideal membership problem.
Year
DOI
Venue
2011
10.1007/978-3-642-32973-9_2
CASC
Keywords
DocType
Volume
algebraic technique,rainbow connectivity problem,polynomial equation,general case,combinatorial problem,algebraic characterization,ideal membership problem,graphs,discrete mathematics
Journal
abs/1109.2291
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
5
2
Name
Order
Citations
PageRank
Prabhanjan Ananth123418.43
Ambedkar Dukkipati28629.68