scientific article; zbMATH DE number 2059946

MaRDI QIDQ4458217zbMATH OpenFDO

Authors Andrew Blinco, S. I. El-Zanati

Publication date 17 March 2004

zbMATH Keywords

cyclic graph decompositiongraph labeling

Mathematics Subject Classification ID

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

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

Cited in

(11)

• 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 complete graphs into almost-bipartite graphs
• On the cyclic decomposition of complete graphs into bipartite graphs
• Decompositions of complete graphs into bipartite 2-regular subgraphs
• On the cyclic decomposition of circulant graphs into bipartite graphs
• On decomposing the complete graph into the union of two disjoint cycles
• On ordered directed -labelings of bipartite digraphs and cyclic digraph decompositions
• A survey on the existence ofG-Designs
• A REMARK ON CIRCULANT DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS BY GREGARIOUS CYCLES
• On cyclic decompositions of complete graphs into tripartite graphs
• A survey on constructive methods for the Oberwolfach problem and its variants

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)