Bounds and complexity results of rainbow vertex-disconnection colorings
A subset $ Y\subseteq V(G) $ in a vertex-colored graph $ G $ is termed rainbow when vertices in $ Y $ receive distinct colors from each other. For each pair of vertices $ w_1, w_2\in V(G) $, if there exists $ \mathcal{F}\subseteq V(G) $ satisfying $ \mathcal{F} $ rainbow and $ w_1, w_2 $ disconnecte...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2025-03-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2025272 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!