A polynomial-time algorithm constructs a properly colored spanning tree of order at least min(n, 2δ^c(G) + 1) in any connected edge-colored graph G whenever such a tree exists.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Above-Guarantee Algorithm for Properly Colored Spanning Trees
A polynomial-time algorithm constructs a properly colored spanning tree of order at least min(n, 2δ^c(G) + 1) in any connected edge-colored graph G whenever such a tree exists.