default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenu C. Laskar
Person information
- affiliation: Clemson University, Department of Mathematical Sciences
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j44]Stephen T. Hedetniemi, Renu C. Laskar, Henry Martyn Mulder:
New resolvability parameters of graphs. AKCE Int. J. Graphs Comb. 17(3): 1028-1038 (2020)
2010 – 2019
- 2018
- [j43]Angsuman Das
, Renu C. Laskar, Nader Jafari Rad:
On α-Domination in Graphs. Graphs Comb. 34(1): 193-205 (2018) - 2013
- [j42]Renu C. Laskar, Henry Martyn Mulder:
Path-neigborhood graphs. Discuss. Math. Graph Theory 33(4): 731-745 (2013) - 2012
- [j41]Renu C. Laskar, Henry Martyn Mulder, Beth Novick:
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs. Australas. J Comb. 52: 185-196 (2012) - [j40]Gilbert Eyabi, Jobby Jacob, Renu C. Laskar, Darren A. Narayan, Dan Pillone:
Minimal rankings of the Cartesian product Kn\Box Km. Discuss. Math. Graph Theory 32(4): 725-735 (2012)
2000 – 2009
- 2009
- [j39]Renu C. Laskar, Jeremy Lyle:
Fall colouring of bipartite graphs and cartesian products of graphs. Discret. Appl. Math. 157(2): 330-338 (2009) - [j38]Renu C. Laskar, Gretchen L. Matthews, Beth Novick, John Villalpando:
On irreducible no-hole L(2, 1)-coloring of trees. Networks 53(2): 206-211 (2009) - 2006
- [j37]Odile Favaron, Renu C. Laskar, Dieter Rautenbach:
t-partitions and s-complete t-partitions of a graph. Australas. J Comb. 36: 295-302 (2006) - [j36]Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu C. Laskar:
Simultaneous graph parameters: Factor domination and factor total domination. Discret. Math. 306(18): 2229-2233 (2006) - 2005
- [j35]Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu C. Laskar:
Generalized subgraph-restricted matchings in graphs. Discret. Math. 293(1-3): 129-138 (2005) - [j34]Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu C. Laskar, Alice A. McRae:
An algorithm for partial Grundy number on trees. Discret. Math. 304(1-3): 108-116 (2005) - 2004
- [j33]Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs:
Offensive alliances in graphs. Discuss. Math. Graph Theory 24(2): 263-175 (2004) - [j32]Endre Boros, Robert E. Jamison, Renu C. Laskar, Henry Martyn Mulder:
On 3-simplicial vertices in planar graphs. Discuss. Math. Graph Theory 24(3): 413-421 (2004) - 2003
- [j31]Peter Dankelmann, Renu C. Laskar:
Factor domination and minimum degree. Discret. Math. 262(1-3): 113-119 (2003) - [j30]Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, Geert C. E. Prins:
On the equality of the partial Grundy and upper ochromatic numbers of graphs. Discret. Math. 272(1): 53-64 (2003) - [j29]Renu C. Laskar, John Villalpando:
Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs. Electron. Notes Discret. Math. 15: 237-240 (2003) - 2000
- [j28]Jean E. Dunbar, Dean G. Hoffman, Renu C. Laskar, Lisa R. Markus:
alpha-Domination. Discret. Math. 211: 11-26 (2000)
1990 – 1999
- 1999
- [j27]Jean E. Dunbar, Johannes H. Hattingh, Renu C. Laskar, Lisa R. Markus:
Domination Using Induced Cliques in Graphs. Ars Comb. 52 (1999) - [j26]J. Ghoshal, Renu C. Laskar, Dan Pillone:
Further Results on Minimal Rankings. Ars Comb. 52 (1999) - [j25]Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus:
Restrained domination in graphs. Discret. Math. 203(1-3): 61-69 (1999) - 1998
- [j24]Johannes H. Hattingh, Renu C. Laskar:
On weak domination in graphs. Ars Comb. 49 (1998) - 1997
- [j23]Gayla S. Domke, Renu C. Laskar:
The bondage and reinforcement numbers of gammaf for some graphs. Discret. Math. 167-168: 249-259 (1997) - 1996
- [j22]J. Ghoshal, Renu C. Laskar, Dan Pillone:
Minimal rankings. Networks 28(1): 45-53 (1996) - [j21]James A. Knisely, Renu C. Laskar:
Cyclic gossiping times for some classes of graphs. Networks 28(3): 135-141 (1996) - 1995
- [j20]Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar:
Nearly perfect sets in graphs. Discret. Math. 138(1-3): 229-246 (1995) - 1994
- [j19]Roger Labahn, Stephen T. Hedetniemi, Renu C. Laskar:
Periodic gossiping on trees. Discret. Appl. Math. 53(1-3): 235-245 (1994) - 1993
- [j18]Martin Charles Golumbic, Renu C. Laskar:
Introduction. Discret. Appl. Math. 44(1-3): 1-3 (1993) - [j17]Martin Charles Golumbic, Renu C. Laskar:
Irredundancy in Circular Arc Graphs. Discret. Appl. Math. 44(1-3): 79-89 (1993) - [j16]Renu C. Laskar, S. Stueckle, Barry L. Piazza:
On the edge-integrity of some graphs and their complements. Discret. Math. 122(1-3): 245-253 (1993) - 1990
- [j15]Stephen T. Hedetniemi, Renu C. Laskar:
Introduction. Discret. Math. 86(1-3): 3-9 (1990) - [j14]Stephen T. Hedetniemi, Renu C. Laskar:
Bibliography on domination in graphs and some basic definitions of domination parameters. Discret. Math. 86(1-3): 257-277 (1990)
1980 – 1989
- 1988
- [j13]Ernest J. Cockayne, Stephen T. Hedetniemi, Renu C. Laskar:
Gallai theorems for graphs, hypergraphs, and set systems. Discret. Math. 72(1-3): 35-47 (1988) - 1987
- [j12]Paul Erdös, W. R. Hare, Stephen T. Hedetniemi, Renu C. Laskar:
On the equality of the grundy and ochromatic numbers of a graph. J. Graph Theory 11(2): 157-159 (1987) - 1986
- [j11]Stephen T. Hedetniemi, Renu C. Laskar, John Pfaff:
A linear algorithm for finding a minimum dominating set in a cactus. Discret. Appl. Math. 13(2-3): 287-292 (1986) - 1984
- [j10]Robert B. Allan, Renu C. Laskar, Stephen T. Hedetniemi:
A note on total domination. Discret. Math. 49(1): 7-13 (1984) - 1983
- [j9]Renu C. Laskar, Douglas R. Shier:
On powers and centers of chordal graphs. Discret. Appl. Math. 6(2): 139-147 (1983) - 1980
- [j8]William G. Frye, Renu C. Laskar:
Path number of bipartite digraphs. J. Comb. Theory B 28(2): 243-244 (1980)
1970 – 1979
- 1978
- [j7]Jean E. Dunbar, Renu C. Laskar:
Finite nets of dimension d. Discret. Math. 22(1): 1-24 (1978) - [j6]Robert B. Allan, Renu C. Laskar:
On domination and independent domination numbers of a graph. Discret. Math. 23(2): 73-76 (1978) - [j5]Renu C. Laskar, Bruce Auerbach:
On complementary graphs with no isolated vertices. Discret. Math. 24(2): 113-118 (1978) - [j4]Renu C. Laskar, Jean E. Dunbar:
Partial Geometry of Dimension Three. J. Comb. Theory A 24(2): 187-201 (1978) - 1976
- [j3]Renu C. Laskar, Bruce Auerbach:
On decomposition of r-partite graphs into edge-disjoint hamilton circuits. Discret. Math. 14(3): 265-268 (1976) - [j2]Bruce Auerbach, Renu C. Laskar:
Some coloring numbers for complete r-partite graphs. J. Comb. Theory B 21(2): 169-170 (1976) - 1975
- [j1]Arthur Pellerin, Renu C. Laskar:
Cubic graphs on twelve vertices and the line graph of a finite affine plane. Discret. Math. 12(1): 27-36 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
