The following pages link to G. Sethuraman (Q206086):
Displaying 50 items.
- Towards optimal embedding of an arbitrary tree in a graceful tree (Q324915) (← links)
- \((2,1)\)-total labeling of a class of subcubic graphs (Q324977) (← links)
- Graceful and cordial labeling of subdivision of graphs (Q327634) (← links)
- Generating graceful trees from caterpillars by recursive attachment (Q327636) (← links)
- All arbitrarily fixed generalized banana trees are graceful (Q691631) (← links)
- Embedding an arbitrary tree in a graceful tree (Q726528) (← links)
- A note on the Erdős--Farber--Lovász conjecture (Q868363) (← links)
- On graceful graphs: Union of \(n\) copies of edge deleted subgraphs of \(K_4\) (Q1307656) (← links)
- On graceful graphs: Pendant edge extensions of a family of complete bipartite and complete tripartite graphs (Q1611439) (← links)
- One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial (Q1861231) (← links)
- Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs (Q1861249) (← links)
- Graceful numbering of an edge-gluing of shell graphs (Q1978166) (← links)
- Decomposition of complete graphs into arbitrary trees (Q2042202) (← links)
- Wirelength of embedding complete multipartite graphs into certain graphs (Q2181259) (← links)
- Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph (Q2374164) (← links)
- Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees (Q2409751) (← links)
- Cycle partition of two-connected and two-edge connected graphs (Q2516513) (← links)
- Almost arbitrary supersubdivision of every graph is cordial (Q2829335) (← links)
- On graceful and cordial labeling of shell graphs. (Q2918623) (← links)
- Generation of graceful trees from arbitrary trees (Q2923325) (← links)
- (Q2999904) (← links)
- (Q3016413) (← links)
- (Q3025214) (← links)
- (Q3070195) (← links)
- A new class of graceful rooted trees (Q3078468) (← links)
- (Q3088472) (← links)
- (Q3119300) (← links)
- (Q3166152) (← links)
- (Q3399351) (← links)
- (Q3452023) (← links)
- (Q3519127) (← links)
- Gracefulness of union of cycle with parallel chords and complete bipartite graphs or paths (Q3561518) (← links)
- (Q3620775) (← links)
- (Q4017048) (← links)
- (Q4346771) (← links)
- (Q4576339) (← links)
- (Q4598952) (← links)
- (Q4909686) (← links)
- (Q5016030) (← links)
- Antimagic labeling of new classes of trees (Q5016222) (← links)
- (Q5033158) (← links)
- Total Colouring of New Classes of Subcubic graphs (Q5044527) (← links)
- Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs (Q5119808) (← links)
- (Q5133180) (← links)
- -labeling of supersubdivided connected graph plus an edge (Q5154575) (← links)
- Generating graceful unicyclic graphs from a given forest (Q5154631) (← links)
- Binomial trees are graceful (Q5154634) (← links)
- (Q5203026) (← links)
- (Q5251916) (← links)
- (Q5403280) (← links)
