Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Cycle decomposition (graph theory)

Known as: Cycle decomposition 
In graph theory, a cycle decomposition is a decomposition (a partitioning of a graph's edges) into cycles. Every vertex in a graph that has a cycle… Expand
Wikipedia

Related topics

Related topics

4 relations
Brian AlspachCycle (graph theory)Matching (graph theory)

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
On cyclic Hamiltonian decompositions of complete k-uniform hypergraphs
Abstract A decomposition C = { C 1 , C 2 , … , C h } of the complete k -uniform hypergraph K n k of order n is called cyclic… Expand
Is this relevant?
2010
2010
An asymptotic solution to the cycle decomposition problem for complete graphs
Let m"1,m"2,...,m"t be a list of integers. It is shown that there exists an integer N such that for all n>=N, the complete graph… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Let's take a break: Trends and cycles in US real GDP
Recent work on trend-cycle decompositions for US real GDP yields the following puzzling features: methods based on Unobserved… Expand
  • table A.1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2009
2009
On Bijective Variants of the Burrows-Wheeler Transform
The sort transform (ST) is a modification of the Burrows-Wheeler transform (BWT). Both transformations map an arbitrary word of… Expand
  • figure 1
Is this relevant?
2007
2007
Equipartite gregarious 6- and 8-cycle systems
A k-cycle decomposition of a complete multipartite graph is said to be gregarious if each k-cycle in the decomposition has its… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
An Efficient Implementation of Braid Groups
We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
1997
1997
Tests and constructions of irreducible polynomials over finite fields
In this paper we focus on tests and constructions of irreducible polynomials over finite fields. We revisit Rabin’s (1980… Expand
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
1993
1993
Sales forecasting considering advertising effect : application of trend-cycle decomposition in cointegrated system = 광고 효과를 고려한 판매 예측 : 共積分된 시계열의 추세-순환치 분리 기법의 적용
 
Is this relevant?
1987
1987
Compatible path-cycle-decompositions of plane graphs
Abstract Sabidussi's Conjecture states that given an Euler trail T in a connected Euler graph, there always exists a cycle… Expand
Is this relevant?
1981
1981
Some Results on the Qualitative Theory of Matrix
In this paper, we discuss the sign stability and the potential stability for the linear time invarient system described by dx/dt… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE