Strongly Even-Cycle Decomposable Graphs

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 48
  • Download : 0
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. (C) 2016 Wiley Periodicals, Inc.
Publisher
WILEY-BLACKWELL
Issue Date
2017-02
Language
English
Article Type
Article
Keywords

EULERIAN GRAPHS; DECOMPOSITIONS

Citation

JOURNAL OF GRAPH THEORY, v.84, no.2, pp.158 - 175

ISSN
0364-9024
DOI
10.1002/jgt.22018
URI
http://hdl.handle.net/10203/251116
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0