Graphs admiting color-avoiding connected colorings are exactly the sufficiently connected graphs, and for simple connectivity the minimum number of colors is computable in polynomial time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Color-avoiding connected colorings and orientations
Graphs admiting color-avoiding connected colorings are exactly the sufficiently connected graphs, and for simple connectivity the minimum number of colors is computable in polynomial time.