On even circuit decompositions of eulerian graphs

DOI10.1002/jgt.3190180106zbMath0804.05053OpenAlexW2156114360MaRDI QIDQ4277987

Cun-Quan Zhang

Publication date: 9 January 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180106

zbMATH Keywords

edge decompositioneven cycleeulerian grapheulerian multigraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items

Even cycle decompositions of index 3 by a novel coloring technique, On 4-connected 4-regular graphs without even cycle decompositions, Even-cycle decompositions of graphs with no odd-\(K_4\)-minor, On the simultaneous edge coloring of graphs, Strongly even cycle decomposable 4-regular line graphs, On even cycle decompositions of 4-regular line graphs, Even cycles and even 2-factors in the line graph of a simple graph, On even cycle decompositions of line graphs of cubic graphs, Strongly Even-Cycle Decomposable Graphs, Strongly even cycle decomposable non-planar line graphs, Even cycle decompositions of 4-regular graphs and line graphs, Triangle-free circuit decompositions and Petersen minor, Circuit decompositions of Eulerian graphs

Cites Work

• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Even circuits in planar graphs
• Circuit decompositions of Eulerian graphs
• On circuit decomposition of planar Eulerian graphs
• Graphs with the Circuit Cover Property
• Unnamed Item
• Unnamed Item
• Unnamed Item