The following pages link to Sheshayya A. Choudum (Q1706424):
Displaying 50 items.
- (Q396671) (redirect page) (← links)
- Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes (Q396672) (← links)
- Embedding a subclass of trees into hypercubes (Q534055) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- On graphic and 3-hypergraphic sequences (Q809101) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- Embedding height balanced trees and Fibonacci trees in hypercubes (Q1031992) (← links)
- On forcibly connected graphic sequences (Q1185077) (← links)
- Some 4-valent, 3-connected, planar, almost pancyclic graphs (Q1237747) (← links)
- Characterizations of 2-variegated graphs and of 3-variegated graphs (Q1252359) (← links)
- An extension of Vizing's adjacency lemma of edge chromatic critical graphs (Q1304811) (← links)
- Graceful labelling of the union of paths and cycles (Q1304813) (← links)
- Ramsey numbers for transitive tournaments (Q1304815) (← links)
- Ordered and canonical Ramsey numbers of stars (Q1359377) (← links)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- There are no edge-chromatic 4-critical graphs of order 12 (Q1894759) (← links)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
- All 5-stars are Skolem graceful (Q2565339) (← links)
- (Q2744380) (← links)
- Tenacity of complete graph products and grids (Q2766101) (← links)
- (Q3025205) (← links)
- (Q3058987) (← links)
- (Q3140340) (← links)
- Perfect coloring and linearly χ-boundP6-free graphs (Q3437005) (← links)
- Distance and Short Parallel Paths in Augmented Cubes (Q3439032) (← links)
- Studying Properties of Graphs through their k-vertex Subsets: I IIκ-complete Graphs and IIκ-completion numbers (Q3439077) (← links)
- (Q3481742) (← links)
- Automorphisms of augmented cubes (Q3543510) (← links)
- Embedding complete ternary trees into hypercubes (Q3633839) (← links)
- (Q3659822) (← links)
- (Q3939839) (← links)
- Regular factors in <i>K</i><sub>1,3</sub>‐free graphs (Q3978368) (← links)
- (Q4000802) (← links)
- (Q4079634) (← links)
- (Q4101859) (← links)
- (Q4101860) (← links)
- (Q4101861) (← links)
- CHROMATIC BOUNDS FOR A CLASS OF GRAPHS (Q4138749) (← links)
- Complete binary trees in folded and enhanced cubes (Q4474302) (← links)
- Bounds for the Independence Number of Critical Graphs (Q4487665) (← links)
- (Q4519722) (← links)
- (Q4635980) (← links)
- (Q4635982) (← links)
- Edge‐chromatic critical graphs and the existence of 1‐factors (Q4693341) (← links)
- Augmented cubes (Q4785222) (← links)
- Optimal fault-tolerant networks with a server (Q4953325) (← links)
- Embedding double starlike trees into hypercubes (Q5391457) (← links)
- (Q5461462) (← links)
