Decomposing graphs under degree constraints
暂无分享,去创建一个
We prove a conjecture of C. Thomassen: If s and t are non-negative integers, and if G is a graph with minimum degree s + t + 1, then the vertex set of G can be partitioned into two sets which induce subgraphs of minimum degree at least s and t , respectively.
[1] Carsten Thomassen. Graph decomposition with constraints on the connectivity and minimum degree , 1983, J. Graph Theory.
[2] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[3] Péter Hajnal. Partition of graphs with condition on the connectivity and minimum degree , 1983, Comb..