On the Rainbow Vertex-Connection
A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertexconn...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
University of Zielona Góra
2013-05-01
|
| Colecção: | Discussiones Mathematicae Graph Theory |
| Assuntos: | |
| Acesso em linha: | https://doi.org/10.7151/dmgt.1664 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|