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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2012
01219742012

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
It is known that if an almost bipartite graph G with n edges possesses a γlabeling, then the complete graphK2nx+1 admits a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
A decomposition of a graph G is a collection ψ of graphs H1, H2, . . . , Hr of G such that every edge of G belongs to exactly one… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
  • I. Sahul
  • 2010
A decomposition of a graph G is a collection ψ of graphs H1, H2, . . . , Hr of G such that every edge of G belongs to exactly one… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
A force decomposition (FD) method previously used for two-body interactions is extended to three-body interactions. Three… (More)
  • figure 1
  • figure 5
  • figure 6
  • figure 7
  • table 1
Is this relevant?
2004
2004
Techniques of labeling the vertices of a bipartite graph G with n edges to yield cyclic G-decompositions of the complete graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
In null convention logic (NCL) circuits, cycles are the fundamental unit of data storage, roughly equivalent to combinational… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
In this paper we study permutations of finite fields Fq that decompose as products of cycles of the same length, and are obtained… (More)
Is this relevant?
2001
2001
Let G be a graph with n edges. It is known that there exists a cyelic Gdecomposition of K 2n+1 if and only if G has a p-Iabeling… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
1998
1998
  • Antoine P. Petitety, Jack J. Dongarraz
  • 1998
In a serial computational environment, transportable eeciency is the essential motivation for developing blocking strategies and… (More)
  • figure 5
Is this relevant?
1974
1974
 
Is this relevant?