Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213): 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.1007/s10958-012-0880-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014264838 / rank | |||
Normal rank | |||
Revision as of 02:46, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds of the number of leaves of spanning trees in graphs without triangles |
scientific article |
Statements
Bounds of the number of leaves of spanning trees in graphs without triangles (English)
0 references
10 January 2013
0 references
number of leaves
0 references
spanning tree
0 references
