The existence of spanning ended system on claw-free graphs (Q1793386)
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: The existence of spanning ended system on claw-free graphs |
scientific article; zbMATH DE number 6953390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The existence of spanning ended system on claw-free graphs |
scientific article; zbMATH DE number 6953390 |
Statements
The existence of spanning ended system on claw-free graphs (English)
0 references
12 October 2018
0 references
Summary: We prove that every connected claw-free graph \(G\) contains a spanning \(k\)-ended system if and only if \(\mathrm{cl}(G)\) contains a spanning \(k\)-ended system, where \(\mathrm{cl}(G)\) denotes Ryjáček closure of \(G\).
0 references
0 references
0 references
0.83200603723526
0 references
0.8209861516952515
0 references
0.802605152130127
0 references
0.7850610017776489
0 references
