scientific article; zbMATH DE number 2059946

zbMATH Open1045.05078MaRDI QIDQ4458217FDOQ4458217

Authors: Andrew Blinco, S. I. El-Zanati 

Publication date: 17 March 2004

Title of this publication is not available (Why is that?)

Recommendations

• On the cyclic decomposition of complete graphs into bipartite graphs
• Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs
• On labeling 2-regular graphs where the number of odd components is at most 2
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• On the cyclic decomposition of circulant graphs into bipartite graphs

zbMATH Keywords

graph labelingcyclic graph 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)

Cited In (10)

• A REMARK ON CIRCULANT DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS BY GREGARIOUS CYCLES
• Decompositions of complete graphs into bipartite 2-regular subgraphs
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• A survey on constructive methods for the Oberwolfach problem and its variants
• On the cyclic decomposition of complete graphs into bipartite graphs
• 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 the cyclic decomposition of circulant graphs into bipartite graphs
• A survey on the existence ofG-Designs
• On Cyclic Decompositions of Complete Graphs into Tripartite Graphs
• On Decomposing the Complete Graph into the Union of Two Disjoint Cycles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458217)