Strongly even-cycle decomposable graphs
Combinatorics
2016-12-28 v4 Discrete Mathematics
Abstract
A graph is strongly even-cycle decomposable if the edge set of every subdivision with an even number of edges can be partitioned into cycles of even length. We prove that several fundamental composition operations that preserve the property of being Eulerian also yield strongly even-cycle decomposable graphs. As an easy application of our theorems, we give an exact characterization of the set of strongly even-cycle decomposable cographs.
Keywords
Cite
@article{arxiv.1209.0160,
title = {Strongly even-cycle decomposable graphs},
author = {Tony Huynh and Andrew D. King and Sang-il Oum and Maryam Verdian-Rizi},
journal= {arXiv preprint arXiv:1209.0160},
year = {2016}
}
Comments
19 pages, 12 figures