Premium
Graph decomposition with constraints on the connectivity and minimum degree
Author(s) -
Thomassen Carsten
Publication year - 1983
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/jgt.3190070204
Subject(s) - combinatorics , mathematics , degree (music) , vertex (graph theory) , graph , discrete mathematics , set (abstract data type) , computer science , physics , acoustics , programming language
For each pair s,t of natural numbers there exist natural numbers f(s,t) and g(s,t) such that the vertex set of each graph of connectivity at least f(s,t) (respectively minimum degree at least g(s,t)) has a decomposition into sets which induce subgraphs of connectivity (respectively minimum degree) at least s and t , respectively.