|
|||||
|
|
Strongly Even‐Cycle Decomposable Graphs |
|
| Authors: | Tony Huynh Andrew D King Sang‐il Oum Maryam Verdian‐Rizi |
| Institution: | 1. DéPARTEMENT DE MATHéMATIQUE, UNIVERSITé LIBRE DE BRUXELLES, BOULEVARD DU TRIOMPHE, BRUSSELS, BELGIUM;2. DEPARTMENT OF MATHEMATICS, SIMON FRASER UNIVERSITY, UNIVERSITY DRIVE, BURNABY, BC, CANADA;3. DEPARTMENT OF MATHEMATICAL SCIENCES, KAIST, DAEHAK‐RO YUSEONG‐GU DAEJEON, SOUTH KOREA |
| 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: | cycle even‐cycle decomposition Eulerian cograph |