Sheshayya A. Choudum

According to our database1, Sheshayya A. Choudum authored at least 36 papers between 1977 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Structural domination and coloring of some (P<sub>7</sub>, C<sub>7</sub>)-free graphs.
CoRR, 2019

2018
Colouring of ( P<sub>3</sub> ∪ P<sub>2</sub>)-free graphs.
Graphs Comb., 2018

2016
Colouring of (P3UP2)-free graphs.
CoRR, 2016

2013
Embedding certain height-balanced trees and complete <i>p</i><sup><i>m</i></sup>-ary trees into hypercubes.
J. Discrete Algorithms, 2013

2011
Embedding double starlike trees into hypercubes.
Int. J. Comput. Math., 2011

Embedding a subclass of trees into hypercubes.
Discret. Math., 2011

2010
Disjoint paths in hypercubes with prescribed origins and lengths.
Int. J. Comput. Math., 2010

Maximal cliques in {P<sub>2</sub> UNION P<sub>3</sub>, C<sub>4</sub>}-free graphs.
Discret. Math., 2010

First-Fit coloring of {P<sub>5</sub>, K<sub>4</sub>-e}-free graphs.
Discret. Appl. Math., 2010

2009
On embedding subclasses of height-balanced trees in hypercubes.
Inf. Sci., 2009

Complete k-ary trees and Hamming graphs.
Australas. J Comb., 2009

2008
Automorphisms of augmented cubes.
Int. J. Comput. Math., 2008

Linear Chromatic Bounds for a Subfamily of 3 <i>K</i> <sub>1</sub>-free Graphs.
Graphs Comb., 2008

Embedding complete ternary trees into hypercubes.
Discuss. Math. Graph Theory, 2008

2007
Perfect coloring and linearly chi-bound <i>P</i><sub>6</sub>-free graphs.
J. Graph Theory, 2007

2005
The class of {3K<sub>1</sub>, C<sub>4</sub>}-free graphs.
Australas. J Comb., 2005

2004
Complete binary trees in folded and enhanced cubes.
Networks, 2004

Dissolved Graphs and Strong Perfect Graph Conjecture.
Ars Comb., 2004

2003
Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers.
Electron. Notes Discret. Math., 2003

Distance and Short Parallel Paths in Augmented Cubes.
Electron. Notes Discret. Math., 2003

2002
Augmented cubes.
Networks, 2002

Ordered Ramsey numbers.
Discret. Math., 2002

2001
Tough-Maximum Graphs.
Ars Comb., 2001

2000
Optimal fault-tolerant networks with a server.
Networks, 2000

1999
Tenacity of complete graph products and grids.
Networks, 1999

Ramsey numbers for transitive tournaments.
Discret. Math., 1999

Graceful labelling of the union of paths and cycles.
Discret. Math., 1999

An extension of Vizing's adjacency lemma on edge chromatic critical graphs.
Discret. Math., 1999

1997
Ordered and Canonical Ramsey Numbers of Stars.
Graphs Comb., 1997

1995
There are no edge-chromatic 4-critical graphs of order 12.
Discret. Math., 1995

1993
Edge-chromatic critical graphs and the existence of 1-factors.
J. Graph Theory, 1993

1991
Regular factors in <i>K</i><sub>1, 3</sub>-free graphs.
J. Graph Theory, 1991

On forcibly connected graphic sequences.
Discret. Math., 1991

On graphic and 3-hypergraphic sequences.
Discret. Math., 1991

1978
Characterizations of 2-variegated graphs and of 3-variegated graphs.
Discret. Math., 1978

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


  Loading...