Partitions of graphs with high minimum degree or connectivity

Research output: Contribution to journal › Article

15 Citations (Scopus)

Original language	English
Pages (from-to)	29-43
Number of pages	15
Journal	Journal of Combinatorial Theory. Series B
Volume	88
DOIs	https://doi.org/10.1016/S0095-8956(03)00028-5
Publication status	Published - 1 May 2003

Access to Document

@article{1d167395bf32484786bc3372b93454de,

title = "Partitions of graphs with high minimum degree or connectivity",

author = "Deryk Osthus and Daniela Kuhn",

year = "2003",

month = may,

day = "1",

doi = "10.1016/S0095-8956(03)00028-5",

language = "English",

volume = "88",

pages = "29--43",

journal = "Journal of Combinatorial Theory. Series B",

publisher = "Elsevier",

}

TY - JOUR

T1 - Partitions of graphs with high minimum degree or connectivity

AU - Osthus, Deryk

AU - Kuhn, Daniela

PY - 2003/5/1

Y1 - 2003/5/1

UR - http://www.scopus.com/inward/record.url?scp=0038287419&partnerID=8YFLogxK

U2 - 10.1016/S0095-8956(03)00028-5

DO - 10.1016/S0095-8956(03)00028-5

M3 - Article

VL - 88

SP - 29

EP - 43

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

ER -