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)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Saad El-Zanati, Kyle King, Jeff Mudrock
- Australasian J. Combinatorics
- 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)

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)

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)

Is this relevant?

2006

2006

- Jianhui Li, Zhongwu Zhou, Richard J. Sadus
- Computer Physics Communications
- 2006

A force decomposition (FD) method previously used for two-body interactions is extended to three-body interactions. Threeâ€¦Â (More)

Is this relevant?

2004

2004

- Andrew Blinco, Saad El-Zanati, Charles Vanden Eynden
- Discrete Mathematics
- 2004

Techniques of labeling the vertices of a bipartite graph G with n edges to yield cyclic G-decompositions of the complete graphâ€¦Â (More)

Is this relevant?

2003

2003

- Steve Masteller, Lief Sorenson
- IEEE Design & Test of Computers
- 2003

In null convention logic (NCL) circuits, cycles are the fundamental unit of data storage, roughly equivalent to combinationalâ€¦Â (More)

Is this relevant?

2003

2003

- Ivelisse M. Rubio, Carlos J. Corrada-Bravo
- International Conference on Finite Fields andâ€¦
- 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

- Saad El-Zanati, Charles Vanden Eynden, Narong Punnim
- Australasian J. Combinatorics
- 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)

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)

Is this relevant?

1974