Renu C. Laskar

发表

A note on total domination

Stephen T. Hedetniemi, Robert B. Allan, Renu C. Laskar, 1984, Discret. Math..

Restrained domination in graphs

Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, 1999, Discret. Math..

On irreducible no‐hole L(2, 1)‐coloring of trees

Gretchen L. Matthews, Beth Novick, Renu C. Laskar, 2009, Networks.

On weak domination in graphs

Johannes H. Hattingh, Renu C. Laskar, 1998, Ars Comb..

A linear algorithm for finding a minimum dominating set in a cactus

Stephen T. Hedetniemi, Renu C. Laskar, John Pfaff, 1986, Discret. Appl. Math..

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs

Henry Martyn Mulder, Beth Novick, Renu C. Laskar, 2011, Australas. J Comb..

Factor domination and minimum degree

Peter Dankelmann, Renu C. Laskar, 2003, Discret. Math..

alpha-Domination

Jean E. Dunbar, Renu C. Laskar, Lisa R. Markus, 2000, Discret. Math..

On decomposition of r-partite graphs into edge-disjoint hamilton circuits

Renu C. Laskar, Bruce Auerbach, R. Laskar, 1976, Discret. Math..

Bibliography on domination in graphs and some basic definitions of domination parameters

Stephen T. Hedetniemi, Renu C. Laskar, S. Hedetniemi, 1991, Discret. Math..

On complementary graphs with no isolated vertices

Renu C. Laskar, Bruce Auerbach, 1978, Discret. Math..

On the equality of the grundy and ochromatic numbers of a graph

Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, 1987, J. Graph Theory.

On the equality of the partial Grundy and upper ochromatic numbers of graphs

Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, 2003, Discret. Math..

Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs

Renu C. Laskar, John Villalpando, 2003, Electron. Notes Discret. Math..

An algorithm for partial Grundy number on trees

Wayne Goddard, Ken Kennedy, Alice A. McRae, 2005, Discret. Math..

Further Results on Minimal Rankings

Renu C. Laskar, Dan Pillone, J. Ghoshal, 1999, Ars Comb..

On 3-simplicial vertices in planar graphs

Endre Boros, Henry Martyn Mulder, Robert E. Jamison, 2004, Discuss. Math. Graph Theory.

Periodic gossiping on trees

Roger Labahn, Stephen T. Hedetniemi, Renu C. Laskar, 1994, Discret. Appl. Math..

Generalized subgraph-restricted matchings in graphs

Wayne Goddard, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi, 2005, Discret. Math..

Nearly perfect sets in graphs

Frederick C. Harris, Alice A. McRae, Jean E. Dunbar, 1995, Discret. Math..

Irredundancy in Circular Arc Graphs

Martin Charles Golumbic, Renu C. Laskar, M. Golumbic, 1993, Discret. Appl. Math..

Simultaneous graph parameters: Factor domination and factor total domination

Wayne Goddard, Michael A. Henning, Peter Dankelmann, 2006, Discret. Math..

T-partitions and S-complete T-partitions of a Graph

Dieter Rautenbach, Odile Favaron, Renu C. Laskar, 2006, Australas. J Comb..

Cubic graphs on twelve vertices and the line graph of a finite affine plane

Renu C. Laskar, Arthur Pellerin, 1975, Discret. Math..

On the edge-integrity of some graphs and their complements

S. Stueckle, Renu C. Laskar, Barry L. Piazza, 1993, Discret. Math..

Some coloring numbers for complete r-partite graphs

Renu C. Laskar, Bruce Auerbach, 1976, J. Comb. Theory, Ser. B.

Introduction

Martin Charles Golumbic, Renu C. Laskar, 1990, Discret. Appl. Math..

The bondage and reinforcement numbers of gammaf for some graphs

Renu C. Laskar, Gayla S. Domke, 1997, Discret. Math..

On $$\alpha $$α-Domination in Graphs

Nader Jafari Rad, Renu C. Laskar, Angsuman Das, 2018, Graphs Comb..

Path-Neighborhood Graphs

Henry Martyn Mulder, Renu C. Laskar, R. Laskar, 2013, Discuss. Math. Graph Theory.

On powers and centers of chordal graphs

Douglas R. Shier, Renu C. Laskar, R. Laskar, 1983, Discret. Appl. Math..

On domination and independent domination numbers of a graph

Robert B. Allan, Renu C. Laskar, R. Laskar, 1978, Discret. Math..

Cyclic gossiping times for some classes of graphs

Renu C. Laskar, James A. Knisely, R. Laskar, 1996, Networks.

Gallai theorems for graphs, hypergraphs, and set systems

Stephen T. Hedetniemi, Renu C. Laskar, Ernest J. Cockayne, 1988, Discret. Math..

Fall colouring of bipartite graphs and cartesian products of graphs

Renu C. Laskar, Jeremy Lyle, 2009, Discret. Appl. Math..

Minimal rankings of the Cartesian product Kn\Box Km

Darren A. Narayan, Renu C. Laskar, Jobby Jacob, 2012, Discuss. Math. Graph Theory.

Offensive alliances in graphs

Wayne Goddard, Odile Favaron, Stephen T. Hedetniemi, 2004, Discuss. Math. Graph Theory.

Finite nets of dimension d

Jean E. Dunbar, Renu C. Laskar, 1978, Discret. Math..

Cyclic gossiping times for some classes of graphs

Renu C. Laskar, James A. Knisely, 1996 .

Minimal rankings

Renu C. Laskar, Dan Pillone, J. Ghoshal, 1996, Networks.

Domination Using Induced Cliques in Graphs

Johannes H. Hattingh, Jean E. Dunbar, Renu C. Laskar, 1999, Ars Comb..

Partial Geometry of Dimension Three

Jean E. Dunbar, Renu C. Laskar, R. Laskar, 1978, J. Comb. Theory, Ser. A.

Path number of bipartite digraphs

Renu C. Laskar, William G. Frye, 1980, J. Comb. Theory, Ser. B.

Chromatic Numbers for Certain Graphs

Renu C. Laskar, William R. Hare, 1972 .

Linear-time Computability of Combinatorial Problems on Generalized-Series-Parallel Graphs

Stephen T. Hedetniemi, Renu C. Laskar, S. Hedetniemi, 1987 .

Finite nets of dimension three. I

Renu C. Laskar, R. Laskar, 1974 .

Chessboard graphs, related designs, and domination parameters

Renu C. Laskar, R. Laskar, Charles Wallis, 1999 .

ON MAXIMUM CHORDAL SUBGRAPH

Paul Erdös, Renu C. Laskar, P. Erdös, 1983 .

Gallai Theorems Involving Domination Parameters

Martin Gairing, Stephen T. Hedetniemi, Renu C. Laskar, 2002 .