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...
Enregistré dans:
| Dans: | URI:https://journals.openedition.org/msh, |
|---|---|
| Auteur principal: | |
| Format: | Article ou chapitre numérique |
| Langue: | Français |
| Publié: |
Mathématiques et sciences humaines
2006
|
| Sujets: | |
| Accès en ligne: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |