Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total (Q5074694)
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 Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total |
scientific article; zbMATH DE number 7523933
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total |
scientific article; zbMATH DE number 7523933 |
Statements
Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total (English)
0 references
9 May 2022
0 references
spanning tree
0 references
branch vertices
0 references
leaves
0 references
claw-free
0 references
0 references
0.90899116
0 references
0.8886996
0 references
0.8789263
0 references
0.8789263
0 references
0.87284946
0 references
0 references
0 references
