Premium
Decomposing graphs under degree constraints
Author(s) -
Stiebitz Michael
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199611)23:3<321::aid-jgt12>3.0.co;2-h
Subject(s) - mathematics , combinatorics , conjecture , degree (music) , vertex (graph theory) , graph , discrete mathematics , set (abstract data type) , computer science , physics , acoustics , programming language
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. © 1996 John Wiley & Sons, Inc.