Cycle Packing in Complete Undirected Graph.

Date of Submission

December 1996

Date of Award

Winter 12-12-1997

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Applied Statistics Unit (ASU-Kolkata)


Roy, Bimal Kumar (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

Packing of uniform 2-factors, (eristing of 4-cycles) in the complete undi- rected graph with n verter considered. For n = 4t, an algorithm is given which is considerably simpler than the ezisting algorithm. This case is modified to get 4t + 3, empirical result for n = 4t + 2. For the cases n = 4t + 1 and n %3D studies are done.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.