Decomposing graphs into a spanning tree, an even graph, and a star forest (Q1732026)
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: Decomposing graphs into a spanning tree, an even graph, and a star forest |
scientific article; zbMATH DE number 7036502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing graphs into a spanning tree, an even graph, and a star forest |
scientific article; zbMATH DE number 7036502 |
Statements
Decomposing graphs into a spanning tree, an even graph, and a star forest (English)
0 references
15 March 2019
0 references
Summary: We prove that every connected graph can be edge-decomposed into a spanning tree, an even graph, and a star forest.
0 references
0.91546404
0 references
0 references
0 references
0.9112035
0 references
0.9046621
0 references
0.9038812
0 references
0 references
