Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Sunil Chandran, L.
291  Ergebnisse:
Personensuche X
?
1

Upper bounding rainbow connection number by forest number:

Sunil Chandran, L. ; Issac, Davis ; Lauri, Juho.
Discrete Mathematics.  345 (2022)  7 - p. 112829 , 2022
Link: https://doi.org/10.1016/..
 
?
2

On Induced Colourful Paths in Triangle-free Graphs:

Babu, Jasine ; Basavaraju, Manu ; Sunil Chandran, L..
Electronic Notes in Discrete Mathematics.  61 (2017)  - p. 69-75 , 2017
Link: https://doi.org/10.1016/..
 
?
3

Rainbow connection number and connected dominating sets:

Sunil Chandran, L. ; Das, Anita ; Rajendraprasad, Deepak.
Journal of Graph Theory.  71 (2011)  2 - p. 206-218 , 2011
Link: https://doi.org/10.1002/..
 
?
4

The hardness of approximating the boxicity, cubicity and th..:

Adiga, Abhijin ; Bhowmick, Diptendu ; Sunil Chandran, L.
Discrete Applied Mathematics.  158 (2010)  16 - p. 1719-1726 , 2010
Link: https://doi.org/10.1016/..
 
?
5

Boxicity of Halin graphs:

Sunil Chandran, L. ; Francis, Mathew C. ; Suresh, Santhosh
Discrete Mathematics.  309 (2009)  10 - p. 3233-3237 , 2009
Link: https://doi.org/10.1016/..
 
?
6

A note on acyclic edge coloring of complete bipartite graph:

Basavaraju, Manu ; Sunil Chandran, L.
Discrete Mathematics.  309 (2009)  13 - p. 4646-4648 , 2009
Link: https://doi.org/10.1016/..
 
?
7

Cubicity, boxicity, and vertex cover:

Sunil Chandran, L. ; Das, Anita ; Shah, Chintan D.
Discrete Mathematics.  309 (2009)  8 - p. 2488-2496 , 2009
Link: https://doi.org/10.1016/..
 
?
8

An upper bound for Cubicity in terms of Boxicity:

Sunil Chandran, L. ; Ashik Mathew, K.
Discrete Mathematics.  309 (2009)  8 - p. 2571-2574 , 2009
Link: https://doi.org/10.1016/..
 
?
9

Bounds on isoperimetric values of trees:

Subramanya Bharadwaj, B.V. ; Sunil Chandran, L.
Discrete Mathematics.  309 (2009)  4 - p. 834-842 , 2009
Link: https://doi.org/10.1016/..
 
?
10

Boxicity and maximum degree:

Sunil Chandran, L. ; Francis, Mathew C. ; Sivadasan, Naveen
Journal of Combinatorial Theory, Series B.  98 (2008)  2 - p. 443-445 , 2008
Link: https://doi.org/10.1016/..
 
?
11

Acyclic edge coloring of subcubic graphs:

Basavaraju, Manu ; Sunil Chandran, L.
Discrete Mathematics.  308 (2008)  24 - p. 6650-6653 , 2008
Link: https://doi.org/10.1016/..
 
?
12

On the relationship between ATSP and the cycle cover proble:

Sunil Chandran, L. ; Shankar Ram, L.
Theoretical Computer Science.  370 (2007)  1-3 - p. 218-228 , 2007
Link: https://doi.org/10.1016/..
 
?
13

The carvingwidth of hypercubes:

Sunil Chandran, L. ; Kavitha, T.
Discrete Mathematics.  306 (2006)  18 - p. 2270-2274 , 2006
Link: https://doi.org/10.1016/..
 
?
14

The treewidth and pathwidth of hypercubes:

Sunil Chandran, L. ; Kavitha, T.
Discrete Mathematics.  306 (2006)  3 - p. 359-365 , 2006
Link: https://doi.org/10.1016/..
 
?
15

Refined memorization for vertex cover:

Sunil Chandran, L. ; Grandoni, Fabrizio
Information Processing Letters.  93 (2005)  3 - p. 125-131 , 2005
Link: https://doi.org/10.1016/..
 
1-15