Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609): 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/s10878-018-0249-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2786602036 / rank | |||
Normal rank | |||
Revision as of 22:59, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-disjoint spanning trees and the number of maximum state circles of a graph |
scientific article |
Statements
Edge-disjoint spanning trees and the number of maximum state circles of a graph (English)
0 references
24 May 2018
0 references
spanning trees
0 references
polynomial-time algorithm
0 references
state circle
0 references
link
0 references
