Results on monochromatic vertex disconnection of graphs
Let $ G $ be a vertex-colored graph. A vertex cut $ S $ of $ G $ is called a <i>monochromatic vertex cut</i> if the vertices of $ S $ are colored with the same color. A graph $ G $ is <i>monochromatically vertex-disconnected</i> if any two nonadjacent vertices of $ G $ have a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2023-04-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2023668?viewType=HTML |