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

^*Corresponding author for this work

Research output: Contribution to journal › Journal article › Research › peer-review

533 Downloads (Orbit)

Abstract

We prove that every connected graph can be edge-decomposed into a spanning tree, an even graph, and a star forest.

Original language	English
Article number	P1.33
Journal	Electronic Journal of Combinatorics
Volume	26
Issue number	1
Number of pages	6
Publication status	Published - 2019

@article{58681e8e60a04eacb5a2949aa6b40f27,

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

abstract = " We prove that every connected graph can be edge-decomposed into a spanning tree, an even graph, and a star forest.",

author = "Lyngsie, \{Kasper Szabo\} and Martin Merker",

year = "2019",

language = "English",

volume = "26",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Australian National University",

number = "1",

}

TY - JOUR

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

AU - Lyngsie, Kasper Szabo

AU - Merker, Martin

PY - 2019

Y1 - 2019

N2 - We prove that every connected graph can be edge-decomposed into a spanning tree, an even graph, and a star forest.

AB - We prove that every connected graph can be edge-decomposed into a spanning tree, an even graph, and a star forest.

M3 - Journal article

SN - 1077-8926

VL - 26

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

M1 - P1.33

ER -