Decomposing graphs into a spanning tree, an even graph, and a star forest

Kasper Szabo Lyngsie, Martin Merker*

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

294 Downloads (Pure)

Abstract

We prove that every connected graph can be edge-decomposed into a spanning tree, an even graph, and a star forest.
Original languageEnglish
Article numberP1.33
JournalThe Electronic Journal of Combinatorics
Volume26
Issue number1
Number of pages6
ISSN1097-1440
Publication statusPublished - 2019

Fingerprint

Dive into the research topics of 'Decomposing graphs into a spanning tree, an even graph, and a star forest'. Together they form a unique fingerprint.

Cite this