Degree condition for subdivisions of unicyclic graphs (Q1015434)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Degree condition for subdivisions of unicyclic graphs |
scientific article; zbMATH DE number 5552211
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree condition for subdivisions of unicyclic graphs |
scientific article; zbMATH DE number 5552211 |
Statements
Degree condition for subdivisions of unicyclic graphs (English)
0 references
8 May 2009
0 references
The authors prove the following results: Let \(H\) be any graph of order \(n\) with \(k\) vertex disjoint pieces \(H_1,\dots, H_k\), each of which contains at most one cycle. Let \(G\) be any graph of order at least \(n\) with \(\delta (G) \geq n -k \). Then \(G\) contains a cyclic subdivision of \(H\).
0 references
degree condition
0 references
subdivision
0 references
unicyclic graph
0 references
0 references
0.8830536
0 references
0.8823429
0 references
0.8816393
0 references
0 references
