Highly Influenced

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

@article{Blinco2004OnTC, title={On the cyclic decomposition of complete graphs into almost-bipartite graphs}, author={Andrew Blinco and Saad El-Zanati and Charles Vanden Eynden}, journal={Discrete Mathematics}, year={2004}, volume={284}, pages={71-81} }

- Published 2004 in Discrete Mathematics
DOI:10.1016/j.disc.2003.11.024

Techniques of labeling the vertices of a bipartite graph G with n edges to yield cyclic G-decompositions of the complete graph K2nx+1 have received much attention in the literature. Up until recently, these techniques have been used mostly with bipartite graphs. An almost-bipartite graph is a non-bipartite graph with the property that the removal of a particular single edge renders the graph bipartite. Examples of such graphs include the odd cycles. Here we introduce the concept of a -labeling… CONTINUE READING