Graphes d'arches
An arch-graph may be obtained from a simple edge by successive addings of 3-paths, grafted on their extremities. Equivalently, it admits no subgraph of which every vertex has degree at least three, and is maximal with this property, for a fixed number of vertices. It is known that a tree distance ma...
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Format: | Artigo |
| Jezik: | Francês |
| Izdano: |
Centre d’analyse et de mathématique sociales de l’EHESS
2002
|
| Teme: | |
| Online dostop: | https://doi.org/10.4000/msh.2858 https://hdl.handle.net/20.500.13089/ighq https://journals.openedition.org/msh/2858 |
| Oznake: |
Brez oznak, prvi označite!
|