Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
cycle decomposition
Description:
Cycle decomposition is the partition of a graph’s edges into cycles, studied in graph theory and combinatorics.
Primary topic:
Advanced Graph Theory Research (42%)
Related topics:
Advanced Graph Theory Research (42%),
Advanced Combinatorial Mathematics (15%),
Limits and Structures in Graph Theory (12%),
Finite Group Theory Research (8%)
OpenAlex ID:
keywords/cycle-decomposition
Dissecting the cycle: a methodological investigation
2002
·
Don Harding
, Adrian Pagan
·
Journal of Monetary Economics
·
1,799
Contemporary design theory : a collection of surveys
1992
·
Jeffrey H. Dinitz
, Douglas R. Stinson
·
534
The r-Stirling numbers
1984
·
Andrei Z Broder
·
Discrete Mathematics
·
399
PDF
Cycle Decompositions of K and K−I
2001
·
Brian Alspach
, Heather Gavlas
·
Journal of Combinatorial Theory Series B
·
291
On the maximal number of independent circuits in a graph
1963
·
G. Dirac
, P. Erdõs
·
Acta Mathematica Academiae Scientiarum Hungaricae
·
241
Cycle decompositions III: Complete graphs and fixed length cycles
2001
·
Mateja Šajna
·
Journal of Combinatorial Designs
·
228
Eulerian Graphs and Related Topics
1991
·
Annals of discrete mathematics
·
217
Some Remarks on Commutators
1951
·
Oystein Ore
·
Proceedings of the American Mathematical Society
·
203
PDF
A Survey of the Cycle Double Cover Conjecture
1985
·
Francois Jaeger
·
North-Holland mathematics studies
·
202
Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k
1981
·
D Sotteau
·
Journal of Combinatorial Theory Series B
·
187
PDF
Business, Housing and Credit Cycles
2016
·
Gerhard Rünstler
, Marente Vlekke
·
Journal of Applied Econometrics
·
164
The Oberwolfach problem and factors of uniform odd length cycles
1989
·
Brian Alspach
, P.J Schellenberg
, et al.
·
Journal of Combinatorial Theory Series A
·
150
Multiview registration of 3D scenes by minimizing error between coordinate frames
2004
·
G.C. Sharp
, S.W. Lee
, et al.
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
149
FactoringN-Cycles and Counting Maps of Given Genus
1998
·
A. Goupil
, Gilles Schaeffer
·
European Journal of Combinatorics
·
137
Model structure analysis through graph theory: partition heuristics and feedback structure decomposition
2004
·
Rogelio Oliva
·
System Dynamics Review
·
123
On circuits in graphs
1984
·
Mohamed H. El-Zahar
·
Discrete Mathematics
·
107
Edge-decompositions of graphs with high minimum degree
2015
·
Ben Barber
, Daniela Kühn
, et al.
·
Advances in Mathematics
·
101
Fulkerson′s Conjecture and Circuit Covers
1994
·
G.H. Fan
, A. Raspaud
·
Journal of Combinatorial Theory Series B
·
94
The existence of Ck-factorizations of K2n − F
1991
·
D.G. Hoffman
, P.J. Schellenberg
·
Discrete Mathematics
·
92
Disjoint cycles in digraphs
1983
·
Carsten Thomassen
·
COMBINATORICA
·
90
Embedding of cycles in arrangement graphs
1993
·
K. Day
, A. Tripathi
·
IEEE Transactions on Computers
·
86
Some observations on the oberwolfach problem
1985
·
Brian Alspach
, Roland Häggkvist
·
Journal of Graph Theory
·
84
Even permutations as a product of two conjugate cycles
1972
·
Edward Bertram
·
Journal of Combinatorial Theory Series A
·
84
PDF
Degree conditions for 2-factors
1997
·
Stephan Brandt
, Guantao Chen
, et al.
·
Journal of Graph Theory
·
83
3,5-Cycle decompositions
1998
·
Peter Adams
, Darryn E. Bryant
, et al.
·
Journal of Combinatorial Designs
·
80
Show more works
View as search
Works count:
1,415
Citation count:
14,360
Year
Topic
Type