Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0707.2760 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Linear Time Minor Tests with Depth-First Search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mathematical Foundations of Computer Science 2003 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parametrized complexity theory. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spanning trees with many leaves in cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spanning Trees with Many Leaves / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4252040 / rank | |||
Normal rank | |||
Latest revision as of 20:23, 27 June 2024
scientific article; zbMATH DE number 5263936
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms |
scientific article; zbMATH DE number 5263936 |
Statements
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (English)
0 references
15 April 2008
0 references
