Cubic graphs on twelve vertices and the line graph of a finite affine plane. - Arthur Pellerin; Renu C. Laskar (Discret. Math., 1975)

On decomposition of r-partite graphs into edge-disjoint hamilton circuits. - Renu C. Laskar; Bruce Auerbach (Discret. Math., 1976)

Some coloring numbers for complete r-partite graphs. - Bruce Auerbach; Renu C. Laskar (J. Comb. Theory B, 1976)

On domination and independent domination numbers of a graph. - Robert B. Allan; Renu C. Laskar (Discret. Math., 1978)

Finite nets of dimension d. - Jean E. Dunbar; Renu C. Laskar (Discret. Math., 1978)

On complementary graphs with no isolated vertices. - Renu C. Laskar; Bruce Auerbach (Discret. Math., 1978)

Partial Geometry of Dimension Three. - Renu C. Laskar; Jean E. Dunbar (J. Comb. Theory A, 1978)

Path number of bipartite digraphs. - William G. Frye; Renu C. Laskar (J. Comb. Theory B, 1980)

On powers and centers of chordal graphs. - Renu C. Laskar; Douglas R. Shier (Discret. Appl. Math., 1983)

A note on total domination. - Robert B. Allan; Renu C. Laskar; Stephen T. Hedetniemi (Discret. Math., 1984)

A linear algorithm for finding a minimum dominating set in a cactus. - Stephen T. Hedetniemi; Renu C. Laskar; John Pfaff (Discret. Appl. Math., 1986)

On the equality of the grundy and ochromatic numbers of a graph. - Paul Erdös; W. R. Hare; Stephen T. Hedetniemi; Renu C. Laskar (J. Graph Theory, 1987)

Gallai theorems for graphs, hypergraphs, and set systems. - Ernest J. Cockayne; Stephen T. Hedetniemi; Renu C. Laskar (Discret. Math., 1988)

Introduction. - Stephen T. Hedetniemi; Renu C. Laskar (Discret. Math., 1990)

Bibliography on domination in graphs and some basic definitions of domination parameters. - Stephen T. Hedetniemi; Renu C. Laskar (Discret. Math., 1990)

Irredundancy in Circular Arc Graphs. - Martin Charles Golumbic; Renu C. Laskar (Discret. Appl. Math., 1993)

Introduction. - Martin Charles Golumbic; Renu C. Laskar (Discret. Appl. Math., 1993)

On the edge-integrity of some graphs and their complements. - Renu C. Laskar; S. Stueckle; Barry L. Piazza (Discret. Math., 1993)

Periodic gossiping on trees. - Roger Labahn; Stephen T. Hedetniemi; Renu C. Laskar (Discret. Appl. Math., 1994)

Nearly perfect sets in graphs. - Jean E. Dunbar; Frederick C. Harris Jr.; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Alice A. McRae; Renu C. Laskar (Discret. Math., 1995)

Minimal rankings. - J. Ghoshal; Renu C. Laskar; Dan Pillone (Networks, 1996)

Cyclic gossiping times for some classes of graphs. - James A. Knisely; Renu C. Laskar (Networks, 1996)

The bondage and reinforcement numbers of gammaf for some graphs. - Gayla S. Domke; Renu C. Laskar (Discret. Math., 1997)

On weak domination in graphs. - Johannes H. Hattingh; Renu C. Laskar (Ars Comb., 1998)

Domination Using Induced Cliques in Graphs. - Jean E. Dunbar; Johannes H. Hattingh; Renu C. Laskar; Lisa R. Markus (Ars Comb., 1999)

Further Results on Minimal Rankings. - J. Ghoshal; Renu C. Laskar; Dan Pillone (Ars Comb., 1999)

Restrained domination in graphs. - Gayla S. Domke; Johannes H. Hattingh; Stephen T. Hedetniemi; Renu C. Laskar; Lisa R. Markus (Discret. Math., 1999)

alpha-Domination. - Jean E. Dunbar; Dean G. Hoffman; Renu C. Laskar; Lisa R. Markus (Discret. Math., 2000)

Factor domination and minimum degree. - Peter Dankelmann; Renu C. Laskar (Discret. Math., 2003)

On the equality of the partial Grundy and upper ochromatic numbers of graphs. - Paul Erdös; Stephen T. Hedetniemi; Renu C. Laskar; Geert C. E. Prins (Discret. Math., 2003)

Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs. - Renu C. Laskar; John Villalpando (Electron. Notes Discret. Math., 2003)

On 3-simplicial vertices in planar graphs. - Endre Boros; Robert E. Jamison; Renu C. Laskar; Henry Martyn Mulder (Discuss. Math. Graph Theory, 2004)

Offensive alliances in graphs. - Odile Favaron; Gerd Fricke; Wayne Goddard; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Petter Kristiansen; Renu C. Laskar; R. Duane Skaggs (Discuss. Math. Graph Theory, 2004)

Generalized subgraph-restricted matchings in graphs. - Wayne Goddard; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Renu C. Laskar (Discret. Math., 2005)

An algorithm for partial Grundy number on trees. - Zhengnan Shi; Wayne Goddard; Stephen T. Hedetniemi; Ken Kennedy; Renu C. Laskar; Alice A. McRae (Discret. Math., 2005)

t-partitions and s-complete t-partitions of a graph. - Odile Favaron; Renu C. Laskar; Dieter Rautenbach (Australas. J Comb., 2006)

Simultaneous graph parameters: Factor domination and factor total domination. - Peter Dankelmann; Michael A. Henning; Wayne Goddard; Renu C. Laskar (Discret. Math., 2006)

Fall colouring of bipartite graphs and cartesian products of graphs. - Renu C. Laskar; Jeremy Lyle (Discret. Appl. Math., 2009)

On irreducible no-hole L(2, 1)-coloring of trees. - Renu C. Laskar; Gretchen L. Matthews; Beth Novick; John Villalpando (Networks, 2009)

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs. - Renu C. Laskar; Henry Martyn Mulder; Beth Novick (Australas. J Comb., 2012)

Minimal rankings of the Cartesian product Kn Box Km. - Gilbert Eyabi; Jobby Jacob; Renu C. Laskar; Darren A. Narayan; Dan Pillone (Discuss. Math. Graph Theory, 2012)

Path-neigborhood graphs. - Renu C. Laskar; Henry Martyn Mulder (Discuss. Math. Graph Theory, 2013)

On α-Domination in Graphs. - Angsuman Das; Renu C. Laskar; Nader Jafari Rad (Graphs Comb., 2018)

New resolvability parameters of graphs. - Stephen T. Hedetniemi; Renu C. Laskar; Henry Martyn Mulder (AKCE Int. J. Graphs Comb., 2020)