Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (Q641183): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.06.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992714766 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spanning spiders and light-splitting switches / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a conjecture of Las Vergnas concerning certain spanning trees in graphs / rank | |||
Normal rank | |||
Latest revision as of 14:10, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs |
scientific article |
Statements
Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (English)
0 references
21 October 2011
0 references
spanning tree
0 references
leaf
0 references
degree sum
0 references
\(K_{1, 4}\)-free
0 references
spanning \(t\)-ended system
0 references
