A characterization of the degree sequence of the graph with cyclomatic number k

作者：Meng, Lei; Yin, Jian-Hua^*

来源：Ars Combinatoria, 2017, 130: 67-70.

• Graph
• degree sequence
• cyclomatic number

Let (d(1), d(2),..., d(n)) be a sequence of positive integers with n-1 >= d(1)>= d(2) >= ...>= dn. We give a characterization of (d(1),d(2),...,d(n)) that is the degree sequence of the graph with cyclomatic number k. This simplifies the characterization of ErdOs-Gallai.

• 出版日期2017-1
• 单位海南大学