ICAR Research Data Repository for Knowledge Management
Decomposing graphs with girth at least five under degree constraints
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
Decomposing graphs with girth at least five under degree constraints
|
|
| Creator |
DIWAN, AA
|
|
| Subject |
graph
decomposition degree girth |
|
| Description |
We prove that the vertex set of a simple graph with minimum degree at least s + t - 1 and girth at least 5 can be decomposed into two parts, which induce subgraphs with minimum degree at least s and t, respectively, where s, t are positive integers greater than or equal to 2. (C) 2000 , Inc.
|
|
| Publisher |
JOHN WILEY & SONS INC
|
|
| Date |
2011-08-04T12:52:22Z
2011-12-26T12:54:43Z 2011-12-27T05:42:57Z 2011-08-04T12:52:22Z 2011-12-26T12:54:43Z 2011-12-27T05:42:57Z 2000 |
|
| Type |
Article
|
|
| Identifier |
JOURNAL OF GRAPH THEORY, 33(4), 237-239
0364-9024 http://dx.doi.org/10.1002/(SICI)1097-0118(200004)33:4<237::AID-JGT4>3.3.CO;2-1 http://dspace.library.iitb.ac.in/xmlui/handle/10054/9366 http://hdl.handle.net/10054/9366 |
|
| Language |
en
|
|