Sheshayya A. Choudum - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2025

Towards Optimal χ-Binding Functions of ($2K_1 \cup K_2$)-Free Graphs and ($P_3 \cup K_1$)-Free GraphsC. U. Angeliya, Sheshayya A. Choudum, Mayamma Joseph. gc, 41(2):39, April 2025. [doi]

2021

Structural domination and coloring of some (P7, C7)-free graphsSheshayya A. Choudum, Thiyagarajan Karthick, Manoj M. Belavadi. DM, 344(3):112244, 2021. [doi]

2018

2)-free graphsArpitha P. Bharathi, Sheshayya A. Choudum. gc, 34(1):97-107, 2018. [doi]

2013

m-ary trees into hypercubesRaman Indhumathi, Sheshayya A. Choudum. jda, 22:53-65, 2013. [doi]

2011

Embedding a subclass of trees into hypercubesSheshayya A. Choudum, S. Lavanya. DM, 311(10-11):866-871, 2011. [doi]

Embedding double starlike trees into hypercubesSheshayya A. Choudum, S. Lavanya, V. Sunitha. ijcm, 88(1):1-5, 2011. [doi]

2010

First-Fit coloring of {P::5::, K::4::-e}-free graphsSheshayya A. Choudum, T. Karthick. DAM, 158(6):620-626, 2010. [doi]

Maximal cliques in {P::2:: UNION P::3::, C::4::}-free graphsSheshayya A. Choudum, T. Karthick. DM, 310(23):3398-3403, 2010. [doi]

Disjoint paths in hypercubes with prescribed origins and lengthsSheshayya A. Choudum, S. Lavanya, V. Sunitha. ijcm, 87(8):1692-1708, 2010. [doi]

2009

Complete k-ary trees and Hamming graphsSheshayya A. Choudum, S. Lavanya. ajc, 45:15-24, 2009. [doi]

On embedding subclasses of height-balanced trees in hypercubesSheshayya A. Choudum, R. Indhumathi. isci, 179(9):1333-1347, 2009. [doi]

2008

Embedding complete ternary trees into hypercubesSheshayya A. Choudum, S. Lavanya. dmgt, 28(3):463-476, 2008. [doi]

Automorphisms of augmented cubesSheshayya A. Choudum, V. Sunitha. ijcm, 85(11):1621-1627, 2008. [doi]

Linear Chromatic Bounds for a Subfamily of 3 ::::K:::: ::1::-free GraphsSheshayya A. Choudum, T. Karthick, M. A. Shalu. gc, 24(5):413-428, 2008. [doi]

2007

Perfect coloring and linearly chi-bound ::::P::::::6::-free graphsSheshayya A. Choudum, T. Karthick, M. A. Shalu. jgt, 54(4):293-306, 2007. [doi]

2005

4}-free graphsSheshayya A. Choudum, M. A. Shalu. ajc, 32:111-116, 2005. [doi]

2004

Complete binary trees in folded and enhanced cubesSheshayya A. Choudum, R. Usha Nandini. networks, 43(4):266-272, 2004. [doi]

Dissolved Graphs and Strong Perfect Graph ConjectureSheshayya A. Choudum, M. A. Shalu. arscom, 73, 2004.

2003

Distance and Short Parallel Paths in Augmented CubesSheshayya A. Choudum, V. Sunitha. endm, 15:64, 2003. [doi]

Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbersE. Sampathkumar, B. Devadas Acharya, Siddani Bhaskara Rao, Sheshayya A. Choudum. endm, 15:164-167, 2003. [doi]

2002

Ordered Ramsey numbersSheshayya A. Choudum, B. Ponnusamy. DM, 247(1-3):79-92, 2002. [doi]

Augmented cubesSheshayya A. Choudum, V. Sunitha. networks, 40(2):71-84, 2002. [doi]

2001

Tough-Maximum GraphsSheshayya A. Choudum, N. Priya. arscom, 61, 2001.

2000

Optimal fault-tolerant networks with a serverSheshayya A. Choudum, S. Sivagurunathan. networks, 35(2):157-160, 2000. [doi]

1999

Ramsey numbers for transitive tournamentsSheshayya A. Choudum, B. Ponnusamy. DM, 206(1-3):119-129, 1999. [doi]

Graceful labelling of the union of paths and cyclesSheshayya A. Choudum, S. Pitchai Muthu Kishore. DM, 206(1-3):105-117, 1999. [doi]

An extension of Vizing s adjacency lemma on edge chromatic critical graphsSheshayya A. Choudum, K. Kayathri. DM, 206(1-3):97-103, 1999. [doi]

Tenacity of complete graph products and gridsSheshayya A. Choudum, N. Priya. networks, 34(3):192-196, 1999. [doi]

1997

Ordered and Canonical Ramsey Numbers of StarsSheshayya A. Choudum, B. Ponnusamy. gc, 13(2):147-158, 1997. [doi]

1995

There are no edge-chromatic 4-critical graphs of order 12Sheshayya A. Choudum, K. Kayathri. DM, 141(1-3):67-73, 1995. [doi]

1993

Edge-chromatic critical graphs and the existence of 1-factorsSheshayya A. Choudum. jgt, 17(1):23-29, 1993. [doi]

1991

On graphic and 3-hypergraphic sequencesSheshayya A. Choudum. DM, 87(1):91-95, 1991. [doi]

1, 3-free graphsSheshayya A. Choudum, M. S. Paulraj. jgt, 15(3):259-265, 1991. [doi]

On forcibly connected graphic sequencesSheshayya A. Choudum. DM, 96(3):175-181, 1991. [doi]

1978

Characterizations of 2-variegated graphs and of 3-variegated graphsVasanti N. Bhat-Nayak, Sheshayya A. Choudum, Ranjan N. Naik. DM, 23(1):17-22, 1978. [doi]

1977

Some 4-valent, 3-connected, planar, almost pancyclic graphsSheshayya A. Choudum. DM, 18(2):125-129, 1977. [doi]

Sign in or sign up to see more results.

runs on WebDSL