Sheshayya A. Choudum

Manoj M. Belavadi

Discret. Math., 2021

2019

Structural domination and coloring of some (P7, C7)-free graphs.

[BibT_eX]

[DOI]

Manoj M. Belavadi

CoRR, 2019

2018

Colouring of ( P3 ∪ P2)-free graphs.

[BibT_eX]

[DOI]

Arpitha P. Bharathi

Graphs Comb., 2018

2016

Colouring of (P3UP2)-free graphs.

[BibT_eX]

[DOI]

Arpitha P. Bharathi

CoRR, 2016

2013

Embedding certain height-balanced trees and complete pm-ary trees into hypercubes.

[BibT_eX]

[DOI]

Indhumathi Raman

J. Discrete Algorithms, 2013

2011

Embedding double starlike trees into hypercubes.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2011

Embedding a subclass of trees into hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

Disjoint paths in hypercubes with prescribed origins and lengths.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

Maximal cliques in {P2 UNION P3, C4}-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

First-Fit coloring of {P5, K4-e}-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

On embedding subclasses of height-balanced trees in hypercubes.

[BibT_eX]

[DOI]

Indhumathi Raman

Inf. Sci., 2009

Complete k-ary trees and Hamming graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2009

2008

Automorphisms of augmented cubes.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2008

Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2008

Embedding complete ternary trees into hypercubes.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2008

2007

Perfect coloring and linearly chi-bound P6-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

2005

The class of {3K1, C4}-free graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

2004

Complete binary trees in folded and enhanced cubes.

[BibT_eX]

[DOI]

Usha Nandini Raghavan

Networks, 2004

Dissolved Graphs and Strong Perfect Graph Conjecture.

[BibT_eX]

Ars Comb., 2004

2003

Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Distance and Short Parallel Paths in Augmented Cubes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

2002

Augmented cubes.

[BibT_eX]

[DOI]

Networks, 2002

Ordered Ramsey numbers.

[BibT_eX]

[DOI]

B. Ponnusamy

Discret. Math., 2002

2001

Tough-Maximum Graphs.

[BibT_eX]

N. Priya

Ars Comb., 2001

2000

Optimal fault-tolerant networks with a server.

[BibT_eX]

[DOI]

S. Sivagurunathan

Networks, 2000

1999

Tenacity of complete graph products and grids.

[BibT_eX]

[DOI]

N. Priya

Networks, 1999

Ramsey numbers for transitive tournaments.

[BibT_eX]

[DOI]

B. Ponnusamy

Discret. Math., 1999

Graceful labelling of the union of paths and cycles.

[BibT_eX]

[DOI]

S. Pitchai Muthu Kishore

Discret. Math., 1999

An extension of Vizing's adjacency lemma on edge chromatic critical graphs.

[BibT_eX]

[DOI]

K. Kayathri

Discret. Math., 1999

1997

Ordered and Canonical Ramsey Numbers of Stars.

[BibT_eX]

[DOI]

B. Ponnusamy

Graphs Comb., 1997

1995

There are no edge-chromatic 4-critical graphs of order 12.

[BibT_eX]

[DOI]

K. Kayathri

Discret. Math., 1995

1993

Edge-chromatic critical graphs and the existence of 1-factors.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

1991

Regular factors in K1, 3-free graphs.

[BibT_eX]

[DOI]

M. S. Paulraj

J. Graph Theory, 1991

On forcibly connected graphic sequences.

[BibT_eX]

[DOI]

Discret. Math., 1991

On graphic and 3-hypergraphic sequences.

[BibT_eX]

[DOI]

Discret. Math., 1991

1978

Characterizations of 2-variegated graphs and of 3-variegated graphs.

[BibT_eX]

[DOI]

Vasanti N. Bhat-Nayak

Ranjan N. Naik

Discret. Math., 1978

1977

Some 4-valent, 3-connected, planar, almost pancyclic graphs.

[BibT_eX]

[DOI]