A variation of the classical Lovasz's (g, f)-parity factor theorem in degree sequences

作者：Guo, Ji-Yun; Yin, Jian-Hua^*

来源：Utilitas Mathematica, 2015, 97: 225-231.

• degree sequence
• parity graphic
• Lovasz's (g, f)-parity factor theorem

Let A(n) = (a(1), a(2), ... , a(n)) and B-n = (b(1), b(2), ... , b(n)) two sequences of nonnegative integers satisfying a(1) >= a(2) >= center dot center dot center dot >= a(n), a(i) <= b(i) for i = 1, 2, ... , n and a(i) = a(i+1) implies that b(i) >= b(i+1) for i = 1, 2, ... , n-1. (A(n); B-n) is said to be parity graphic if a(i) equivalent to b(i) (mod 2) for each i and there exists a simple graph G with vertices v(1), v(2), ... , v(n) such that a(i) <= d(G)(v(i)) <= b(i) and d(G)(v(i)) equivalent to b(i) (mod 2) for each i. In this paper, we give a characterization for (A(n); B-n) to be parity-graphic.

• 出版日期2015-7
• 单位海南大学