Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Sampathkumar, E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complement of a graph: A generalization
E. Sampathkumar
,
L. Pushpalatha
Graphs and Combinatorics
14
(4), 1998, pp. 377-392
Set domination in graphs
E. Sampathkumar
,
L. Pushpa Latha
Journal of Graph Theory
18
(5), 1994, pp. 489-495
Generalizations of independence and chromatic numbers of a graph
E. Sampathkumar
Discrete Mathematics
115
(1-3), 1993, pp. 245-251
A generalization of Menger's theorem for certain unicyclic graphs
E. Sampathkumar
Graphs and Combinatorics
8
, 1992, pp. 377-380
Reconstruction of a pair of graphs from their concatenations
Sukhamay Kundu
,
E. Sampathkumar
,
James Shearer
,
Dean Sturtevant
SIAM Journal on Algebraic Discrete Methods
1
, 1980, pp. 228-231
Reconstruction of a tree from its homomorphic images and other related transforms
Sukhamay Kundu
,
E. Sampathkumar
,
V.N. Bhave
Journal of Combinatorial Theory Series B
20
, 1976, pp. 117-123
Partition graphs and coloring numbers of a graph
E. Sampathkumar
,
V.N. Bhave
Discrete Mathematics
16
, 1976, pp. 57-60