Hardness and Algorithms for Rainbow Connection
Hardness and Algorithms for Rainbow Connection
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
An edge-colored graph \(G\) is {\em rainbow connected} if any two vertices are connected by a path whose edges have distinct colors. The {\em rainbow connection} of a connected graph \(G\), denoted \(rc(G)\), is the smallest number of colors that are needed in order to make \(G\) rainbow connected. In the first result of this paper we prove that co...
Alternative Titles
Full title
Hardness and Algorithms for Rainbow Connection
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2090415232
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2090415232
Other Identifiers
E-ISSN
2331-8422
