Convex extendable trees
| Data(s) |
11/04/2012
11/04/2012
1999
|
|---|---|
| Resumo |
The concept of convex extendability is introduced to answer the problem of finding the smallest distance convex simple graph containing a given tree. A problem of similar type with respect to minimal path convexity is also discussed. Cochin University Of Science and Technology |
| Identificador |
Discrete Mathematics 206 (1999) 179-185 |
| Idioma(s) |
en |
| Publicador |
Elsevier |
| Palavras-Chave | #Geodesic convexity #Minimal path convexity #Distance convex simple graphs #Convex extendable trees |
| Tipo |
Working Paper |
