On the cyclic decomposition of complete graphs into almost-bipartite graphs

DOI10.1016/j.disc.2003.11.024zbMath1044.05057OpenAlexW2016639777MaRDI QIDQ1876676

Andrew Blinco, Saad I. El-Zanati, Charles Vanden Eynden

Publication date: 20 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.024

zbMATH Keywords

Graph labelingAlmost-bipartiteCyclic decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (15)

Cyclic even cycle systems of the complete graph ⋮ Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles ⋮ On Decomposing the Complete Graph into the Union of Two Disjoint Cycles ⋮ On the metamorphosis of a \(G\)-design into a (\(G-e\))-design ⋮ Unnamed Item ⋮ On 1-rotational decompositions of complete graphs into tripartite graphs ⋮ Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor ⋮ On cyclic decompositions of the complete graph into the 2-regular graphs ⋮ -labeling of supersubdivided connected graph plus an edge ⋮ On Cyclic Decompositions of Complete Graphs into Tripartite Graphs ⋮ A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv ⋮ Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph ⋮ A non-existence result on cyclic cycle-decompositions of the cocktail party graph ⋮ Some constructions for cyclic perfect cycle systems ⋮ Mutually orthogonal cycle systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• All 2-regular graphs consisting of 4-cycles are graceful
• Skolem-type difference sets for cycle systems
• Cyclically decomposing the complete graph into cycles
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Existence of cyclic \(k\)-cycle systems of the complete graph
• Graceful valuations of 2-regular graphs with two components
• Cycle decompositions III: Complete graphs and fixed length cycles
• On the cyclic decompositions of the complete graph into polygons with odd number of edges

This page was built for publication: On the cyclic decomposition of complete graphs into almost-bipartite graphs