Name
Abstract | ||
|---|---|---|
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. (C) 1996 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
1996 | 3.3.CO;2-B" target="_self" class="small-link-text"10.1002/(SICI)1097-0118(199611)23:33.3.CO;2-B | Journal of Graph Theory |
Field | DocType | Volume |
Integer,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Degree (graph theory),Conjecture,Mathematics | Journal | 23 |
Issue | ISSN | Citations |
3 | 0364-9024 | 35 |
PageRank | References | Authors |
2.47 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Stiebitz | 1 | 207 | 30.08 |