Augmented cubes SA Choudum, V Sunitha
Networks: An International Journal 40 (2), 71-84, 2002
213 2002 A simple proof of the Erdos-Gallai theorem on graph sequences SA Choudum
Bulletin of the Australian Mathematical Society 33 (1), 67-70, 1986
98 1986 Tenacity of complete graph products and grids SA Choudum, N Priya
Networks: An International Journal 34 (3), 192-196, 1999
54 1999 Complete binary trees in folded and enhanced cubes SA Choudum, RU Nandini
Networks: An International Journal 43 (4), 266-272, 2004
46 2004 Perfect coloring and linearly χ‐bound P 6 ‐free graphs SA Choudum, T Karthick, MA Shalu
Journal of Graph Theory 54 (4), 293-306, 2007
38 2007 Regular factors in K 1,3 ‐free graphs SA Choudum, MS Paulraj
Journal of graph theory 15 (3), 259-265, 1991
38 1991 Colouring of -free graphs AP Bharathi, SA Choudum
Graphs and Combinatorics 34, 97-107, 2018
25 2018 Line-clique cover number of a graph SA Choudum, KR Parthasarathy, G Ravindra
Proc. Indian National Science Academy 41, 289-293, 1975
24 1975 Maximal cliques in {P2∪ P3, C4}-free graphs SA Choudum, T Karthick
Discrete mathematics 310 (23), 3398-3403, 2010
23 2010 Linear Chromatic Bounds for a Subfamily of 3K 1 -free Graphs SA Choudum, T Karthick, MA Shalu
Graphs and Combinatorics 24 (5), 413-428, 2008
22 2008 Automorphisms of augmented cubes SA Choudum, V Sunitha
International Journal of Computer Mathematics 85 (11), 1621-1627, 2008
21 2008 Embedding height balanced trees and Fibonacci trees in hypercubes SA Choudum, I Raman
Journal of Applied Mathematics and Computing 30 (1), 39-52, 2009
19 2009 Bounds for the independence number of critical graphs G Brinkmann, SA Choudum, S Grünewald, E Steffen
Bulletin of the London Mathematical Society 32 (2), 137-140, 2000
18 2000 Tenacity-maximum graphs SA Choudum, N Priya
Journal of Combinatorial Mathematics and Combinatorial Computing 37, 101-114, 2001
17 2001 Chromatic bounds for a class of graphs SA Choudum
The Quarterly Journal of Mathematics 28 (3), 257-270, 1977
17 1977 On embedding subclasses of height-balanced trees in hypercubes SA Choudum, R Indhumathi
Information Sciences 179 (9), 1333-1347, 2009
15 2009 Graceful labelling of the union of paths and cycles SA Choudum, SPM Kishore
Discrete mathematics 206 (1-3), 105-117, 1999
15 1999 On graphic and 3-hypergraphic sequences SA Choudum
Discrete mathematics 87 (1), 91-95, 1991
15 1991 On forcibly sequences SA Choudum
Discrete mathematics 96, 175-181, 1991
15 1991 Optimal fault‐tolerant networks with a server SA Choudum, S Sivagurunathan
Networks: An International Journal 35 (2), 157-160, 2000
14 2000