Rainbow Vertex-Connection and Forbidden Subgraphs
A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them. For a connected graph G, the rainbow vertex-co...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
University of Zielona Góra
2018-02-01
|
| Serier: | Discussiones Mathematicae Graph Theory |
| Fag: | |
| Online adgang: | https://doi.org/10.7151/dmgt.2004 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|