Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Zhai, Dong Yang"'
A simple graph $G$ is an {\it 2-tree} if $G=K_3$, or $G$ has a vertex $v$ of degree 2, whose neighbors are adjacent, and $G-v$ is an 2-tree. Clearly, if $G$ is an 2-tree on $n$ vertices, then $|E(G)|=2n-3$. A non-increasing sequence $\pi=(d_1,\ldots,
Externí odkaz:
http://arxiv.org/abs/1807.00470
Autor:
Zeng, De Yan1 (AUTHOR), Zhai, Dong Yang1 (AUTHOR), Yin, Jian Hua2 (AUTHOR) yinjh@hainanu.edu.cn
Publikováno v:
Acta Mathematica Sinica. Apr2020, Vol. 36 Issue 4, p462-486. 25p. 1 Diagram, 1 Graph.
