 | 2011 |
| 25 |  | Sheshayya A. Choudum,
S. Lavanya:
Embedding a subclass of trees into hypercubes.
Discrete Mathematics 311(10-11): 866-871 (2011) |
| 24 |  | Sheshayya A. Choudum,
S. Lavanya,
V. Sunitha:
Embedding double starlike trees into hypercubes.
Int. J. Comput. Math. 88(1): 1-5 (2011) |
| 2010 |
| 23 |  | Sheshayya A. Choudum,
T. Karthick:
First-Fit coloring of {P5, K4-e}-free graphs.
Discrete Applied Mathematics 158(6): 620-626 (2010) |
| 22 |  | Sheshayya A. Choudum,
T. Karthick:
Maximal cliques in {P2 UNION P3, C4}-free graphs.
Discrete Mathematics 310(23): 3398-3403 (2010) |
| 21 |  | Sheshayya A. Choudum,
S. Lavanya,
V. Sunitha:
Disjoint paths in hypercubes with prescribed origins and lengths.
Int. J. Comput. Math. 87(8): 1692-1708 (2010) |
| 2009 |
| 20 |  | Sheshayya A. Choudum,
R. Indhumathi:
On embedding subclasses of height-balanced trees in hypercubes.
Inf. Sci. 179(9): 1333-1347 (2009) |
| 2008 |
| 19 |  | Sheshayya A. Choudum,
S. Lavanya:
Embedding complete ternary trees into hypercubes.
Discussiones Mathematicae Graph Theory 28(3): 463-476 (2008) |
| 18 |  | Sheshayya A. Choudum,
T. Karthick,
M. A. Shalu:
Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs.
Graphs and Combinatorics 24(5): 413-428 (2008) |
| 17 |  | Sheshayya A. Choudum,
V. Sunitha:
Automorphisms of augmented cubes.
Int. J. Comput. Math. 85(11): 1621-1627 (2008) |
| 2007 |
| 16 |  | Sheshayya A. Choudum,
T. Karthick,
M. A. Shalu:
Perfect coloring and linearly chi-bound P6-free graphs.
Journal of Graph Theory 54(4): 293-306 (2007) |
| 2004 |
| 15 |  | Sheshayya A. Choudum,
M. A. Shalu:
Dissolved Graphs and Strong Perfect Graph Conjecture.
Ars Comb. 73: (2004) |
| 14 |  | Sheshayya A. Choudum,
R. Usha Nandini:
Complete binary trees in folded and enhanced cubes.
Networks 43(4): 266-272 (2004) |
| 2003 |
| 13 |  | E. Sampathkumar,
B. Devadas Acharya,
Siddani Bhaskara Rao,
Sheshayya A. Choudum:
Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers.
Electronic Notes in Discrete Mathematics 15: 164-167 (2003) |
| 12 |  | Sheshayya A. Choudum,
V. Sunitha:
Distance and Short Parallel Paths in Augmented Cubes.
Electronic Notes in Discrete Mathematics 15: 64 (2003) |
| 2002 |
| 11 |  | Sheshayya A. Choudum,
B. Ponnusamy:
Ordered Ramsey numbers.
Discrete Mathematics 247(1-3): 79-92 (2002) |
| 10 |  | Sheshayya A. Choudum,
V. Sunitha:
Augmented cubes.
Networks 40(2): 71-84 (2002) |
| 2001 |
| 9 |  | Sheshayya A. Choudum,
N. Priya:
Tough-Maximum Graphs.
Ars Comb. 61: (2001) |
| 2000 |
| 8 |  | Sheshayya A. Choudum,
S. Sivagurunathan:
Optimal fault-tolerant networks with a server.
Networks 35(2): 157-160 (2000) |
| 1999 |
| 7 |  | Sheshayya A. Choudum,
S. Pitchai Muthu Kishore:
Graceful labelling of the union of paths and cycles.
Discrete Mathematics 206(1-3): 105-117 (1999) |
| 6 |  | Sheshayya A. Choudum,
B. Ponnusamy:
Ramsey numbers for transitive tournaments.
Discrete Mathematics 206(1-3): 119-129 (1999) |
| 5 |  | Sheshayya A. Choudum,
K. Kayathri:
An extension of Vizing's adjacency lemma on edge chromatic critical graphs.
Discrete Mathematics 206(1-3): 97-103 (1999) |
| 4 |  | Sheshayya A. Choudum,
N. Priya:
Tenacity of complete graph products and grids.
Networks 34(3): 192-196 (1999) |
| 1995 |
| 3 |  | Sheshayya A. Choudum,
K. Kayathri:
There are no edge-chromatic 4-critical graphs of order 12.
Discrete Mathematics 141(1-3): 67-73 (1995) |
| 1991 |
| 2 |  | Sheshayya A. Choudum:
On graphic and 3-hypergraphic sequences.
Discrete Mathematics 87(1): 91-95 (1991) |
| 1 |  | Sheshayya A. Choudum:
On forcibly connected graphic sequences.
Discrete Mathematics 96(3): 175-181 (1991) |