DeepAI AI Chat
Log In Sign Up

Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach

by   Amin Bahmanian, et al.

Using the technique of amalgamation-detachment, we show that the complete equipartite multigraph λ K_n× m can be decomposed into cycles of lengths c_1m,...,c_km (plus a 1-factor if the degree is odd) whenever there exists a decomposition of λ m K_n into cycles of lengths c_1, ...,c_k (plus a 1-factor if the degree is odd). In addition, we give sufficient conditions for the existence of some other, related cycle decompositions of the complete equipartite multigraph λ K_n× m.


page 1

page 2

page 3

page 4


Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions

We develop a framework for graph sparsification and sketching, based on ...

Short Cycles via Low-Diameter Decompositions

We present improved algorithms for short cycle decomposition of a graph....

On Existence of Must-Include Paths and Cycles in Undirected Graphs

Given an undirected graph G=(V,E) and vertices s,t,w_1,w_2∈ V, we study ...

Alternating Hamiltonian cycles in 2-edge-colored multigraphs

A path (cycle) in a c-edge-colored multigraph is alternating if no two c...

Extra-factorial sum: a graph-theoretic parameter in Hamiltonian cycles of complete weighted graphs

A graph-theoretic parameter, in a form of a function, called the extra-f...

Comparison of the shape and temporal evolution of even and odd solar cycles

Results. The PCA confirms the existence of the Gnevyshev gap (GG) for so...

Context-aware and Scale-insensitive Temporal Repetition Counting

Temporal repetition counting aims to estimate the number of cycles of a ...