Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs (Q2298039): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2019/1348348 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2977359852 / rank | |||
Normal rank | |||
Revision as of 23:35, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs |
scientific article |
Statements
Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs (English)
0 references
20 February 2020
0 references
Summary: A graph \(G\) is called \(K_{1,5}\)-free if \(G\) contains no \(K_{1,5}\) as an induced subgraph. A tree with at most \(m\) leaves is called an \(m\)-ended tree. Let \(\sigma_k \left(G\right)\) be the minimum degree sum of \(k\) independent vertices in \(G\). In this paper, it is shown that every connected \(K_{1,5}\)-free graph \(G\) contains a spanning 6-ended tree if \(\sigma_7 \left(G\right) \geq |G|- 2\).
0 references
