Search the dblp DataBase
Renu Laskar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Jean E. Dunbar, Johannes H. Hattingh, Renu Laskar, Lisa R. Markus
Domination Using Induced Cliques in Graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1999, v:52, n:, pp:- [Journal] - J. Ghoshal, Renu Laskar, D. Pillone
Further Results on Minimal Rankings. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1999, v:52, n:, pp:- [Journal] - Johannes H. Hattingh, Renu Laskar
On weak domination in graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1998, v:49, n:, pp:- [Journal] - Martin Charles Golumbic, Renu Laskar
Irredundancy in Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:79-89 [Journal] - Martin Charles Golumbic, Renu Laskar
Introduction. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:1-3 [Journal] - Roger Labahn, Stephen T. Hedetniemi, Renu Laskar
Periodic gossiping on trees. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:235-245 [Journal] - Paul Erdös, Stephen T. Hedetniemi, Renu Laskar, Geert C. E. Prins
On the equality of the partial Grundy and upper ochromatic numbers of graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2003, v:272, n:1, pp:53-64 [Journal] - Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar
Generalized subgraph-restricted matchings in graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2005, v:293, n:1-3, pp:129-138 [Journal] - Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, Alice A. McRae
An algorithm for partial Grundy number on trees. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2005, v:304, n:1-3, pp:108-116 [Journal] - Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar
Simultaneous graph parameters: Factor domination and factor total domination. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2006, v:306, n:18, pp:2229-2233 [Journal] - Renu Laskar, Jean E. Dunbar
Partial Geometry of Dimension Three. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1978, v:24, n:2, pp:187-201 [Journal] - William G. Frye, Renu Laskar
Path number of bipartite digraphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:243-244 [Journal] - Bruce Auerbach, Renu Laskar
Some coloring numbers for complete r-partite graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1976, v:21, n:2, pp:169-170 [Journal] - J. Ghoshal, Renu Laskar, D. Pillone
Minimal rankings. [Citation Graph (0, 0)][DBLP]
Networks, 1996, v:28, n:1, pp:45-53 [Journal] - James A. Knisely, Renu Laskar
Cyclic gossiping times for some classes of graphs. [Citation Graph (0, 0)][DBLP]
Networks, 1996, v:28, n:3, pp:135-141 [Journal] - Robert B. Allan, Renu Laskar, Stephen T. Hedetniemi
A note on total domination. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1984, v:49, n:1, pp:7-13 [Journal] - Ernest J. Cockayne, Stephen T. Hedetniemi, Renu Laskar
Gallai theorems for graphs, hypergraphs, and set systems. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1988, v:72, n:1-3, pp:35-47 [Journal] - Renu Laskar, S. Stueckle, B. Piazza
On the edge-integrity of some graphs and their complements. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:122, n:1-3, pp:245-253 [Journal]
Fall colouring of bipartite graphs and cartesian products of graphs. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002