Articles in Scholarly Journals [Incomplete List]

1. Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
   Combinatorics, Probability and Computing, vol. 16, no. 02, p. 271, 2007
2. Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5
   Graphs and Combinatorics, vol. 23, no. 2, pp. 145–163, 2007
3. Bi-cyclic decompositions of complete graphs into spanning trees☆
   Discrete Mathematics, vol. 307, no. 11-12, pp. 1317–1322, 2007
4. Pancomponented 2-factorizations of complete graphs
   Discrete Mathematics, vol. 299, no. 1-3, pp. 99–112, 2005
5. Some remarks on domination
   Journal of Graph Theory, vol. 46, no. 3, pp. 207–210, 2004
6. On seed graphs with more than two components
   Discrete Mathematics, vol. 233, no. 1-3, pp. 115–126, 2001
7. Corrigendum to “Almost self-complementary factors of complete bipartite graphs” [Discrete Math. 167/168 (1997) 317–327]
   Discrete Mathematics, vol. 232, no. 1-3, pp. 195–197, 2001
8. Self-complementary factors of almost complete tripartite graphs of even order
   Discrete Mathematics, vol. 236, no. 1-3, pp. 111–122, 2001
9. Symmetric graph designs on friendship graphs
   Journal of Combinatorial Designs, vol. 8, no. 3, p. 201, 2000
10. Halving transversal designs
    Journal of Combinatorial Designs, vol. 8, no. 2, pp. 83–99, 2000
11. Almost self-complementary factors of complete bipartite graphs
    Discrete Mathematics, vol. 167-168, pp. 317–327, 1997
12. Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
    Graphs and Combinatorics, vol. 12, no. 1, pp. 305–320, 1996
13. The Existence of Selfcomplementary Circulant Graphs
    European Journal of Combinatorics, vol. 17, no. 7, pp. 625–628, 1996
14. e-Realization of double-stars
    Discrete Mathematics, vol. 126, no. 1-3, pp. 399–402, 1994