Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edge-disjoint spanning trees and the number of maximum state circles of a graph |
scientific article; zbMATH DE number 6872594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-disjoint spanning trees and the number of maximum state circles of a graph |
scientific article; zbMATH DE number 6872594 |
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
0 references
