On the cyclic decomposition of complete graphs into almost-bipartite graphs
From MaRDI portal
Publication:1876676
DOI10.1016/j.disc.2003.11.024zbMath1044.05057MaRDI QIDQ1876676
Charles Vanden Eynden, Saad I. El-Zanati, Andrew Blinco
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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item