Under a minimum degree condition the paper proves that a collection of n-vertex graphs is rainbow panconnected, improving two prior results.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Rainbow panconnectivity in a graph collection
Under a minimum degree condition the paper proves that a collection of n-vertex graphs is rainbow panconnected, improving two prior results.