Strongly Even-Cycle Decomposable Graphs.
In: Journal of Graph Theory, Jg. 84 (2017-02-01), Heft 2, S. 158-175
Online
academicJournal
Zugriff:
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. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Graph Theory is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Titel: |
Strongly Even-Cycle Decomposable Graphs.
|
---|---|
Autor/in / Beteiligte Person: | Huynh, Tony ; King, Andrew D. ; Oum, Sang‐il ; Verdian‐Rizi, Maryam |
Link: | |
Zeitschrift: | Journal of Graph Theory, Jg. 84 (2017-02-01), Heft 2, S. 158-175 |
Veröffentlichung: | 2017 |
Medientyp: | academicJournal |
ISSN: | 0364-9024 (print) |
DOI: | 10.1002/jgt.22018 |
Schlagwort: |
|
Sonstiges: |
|