Decomposing graphs with girth at least five under degree constraints

✍ Scribed by Diwan, Ajit A.

• Publisher: John Wiley and Sons
• Year: 2000
• Tongue: English
• Weight: 137 KB
• Volume: 33
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/(sici)1097-0118(200004)33:4<237::aid-jgt4>3.0.co;2-a

✦ Synopsis

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 ≥ 2.