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}
}
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

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

On certain valuations of the vertices of a graph

  • A. Rosa
  • in: ThW eorie des graphes, journW ees…
  • 1967
Highly Influential
7 Excerpts

On the cyclic decomposition of the complete graph into (4m+ 2)-gons

  • A. Rosa
  • Mat.-Fyz. T Casopis Sloven. Akad. Vied 16
  • 1966
Highly Influential
9 Excerpts

On the cyclic decompositions of the complete graph into polygons with odd number of edges

  • A. Rosa
  • T Casopis PT est. Mat. 91
  • 1966
Highly Influential
11 Excerpts

A note on the cyclic decomposition of complete graphs into bipartite graphs

  • A. Blinco, S. I. El-Zanati
  • Bull. Inst. Combin. Appl. 40
  • 2004
1 Excerpt

Skolem - type diSerence sets for cycle systems , Electron

  • H. Gavlas D. Bryant, A. C. Ling
  • 2003

The existence and construction of -valuations of 2-regular graphs with 3 components

  • K. Eshghi
  • Ph.D. Thesis, Industrial Engineering Department…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…