An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size
A graph $G$ is a $2$<i>-tree</i> if $G=K_3$, or $G$ has a vertex $v$ of degree 2, whose neighbors are adjacent, and $G-v$ is a 2-tree. Clearly, if $G$ is a 2-tree on $n$ vertices, then $|E(G)|=2n-3$. A non-increasing sequence $\pi =(d_1, \ldots ,d_n)$ of nonnegative integers is a <i>graphic sequence...
Zapisane w:
| Główni autorzy: | , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Discrete Mathematics & Theoretical Computer Science
2016-08-01
|
| Seria: | Discrete Mathematics & Theoretical Computer Science |
| Hasła przedmiotowe: | |
| Dostęp online: | https://dmtcs.episciences.org/2152/pdf |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|