Preprints or Unpublished Papers On generation of graceful trees. E3-cordial graphs (.pdf), (with R. Yilmaz), submitted to Ars Combinatoria Packing graceful trees of different order into the complete graph. Regularable graphs, (with A. Unveren). On the totally and minimum irregular edge labelling of graphs, (with M. Tezer). On zero-rotatable small graceful trees:(Part I) Caterpillars (.pdf) Some totally modular cordial graphs. Deadlock-free message routing in k-ary n-cube networks using virtual channels. Irregular assignment of the forest of paths (.pdf),(with M. Tezer). Cycle-routing for photonic interconnection networks. The characterization of all maximal planar graphs (.pdf), (with M. Ozel), submitted to Ars Combinatoria. Embedding cubic trees into rectangular grids (.pdf),  submitted to Journal of Graph Algorithms and Applications (electronic).        Papers in preparation Cycle-routing in recirculating interconnection networks, (with A. Adalier). On hamiltonian cycle decomposition of the shufflenet, (with M. Tezer). On zero-rotatable small graceful trees:(Part II) Diameter four  trees. Cycle decomposition of the dense diamond-torus.