The following pages link to (Q5589124):
Displaying 50 items.
- The gracefulness of the join of graphs. II (Q322012) (← links)
- Properly even harmonious labelings of disconnected graphs (Q322017) (← links)
- Even harmonious labelings of disjoint graphs with a small component (Q322018) (← links)
- Alpha labelings of full hexagonal caterpillars (Q322060) (← links)
- New classes of graceful unicyclic graphs (Q324903) (← links)
- The gracefulness of the join of graphs (Q324910) (← links)
- Towards optimal embedding of an arbitrary tree in a graceful tree (Q324915) (← links)
- \(k\)-Zumkeller labeling for twig graphs (Q324928) (← links)
- Gracefully cultivating trees on a cycle (Q324938) (← links)
- Graceful digraphs and complete mappings (Q324941) (← links)
- Super edge magic graceful labeling of generalized Petersen graphs (Q324969) (← links)
- A new measure for gracefulness of graphs (Q324979) (← links)
- Super total graceful graphs (Q324988) (← links)
- Graceful and cordial labeling of subdivision of graphs (Q327634) (← links)
- Generating graceful trees from caterpillars by recursive attachment (Q327636) (← links)
- Further results on graceful directed graphs (Q327637) (← links)
- Edge-graceful labelings of connected graphs (Q327663) (← links)
- Further results on super graceful labeling of graphs (Q334139) (← links)
- On modular edge-graceful graphs (Q354418) (← links)
- Cubic factorizations (Q383761) (← links)
- A complete solution to the two-table Oberwolfach problems (Q385030) (← links)
- Tree-designs with balanced-type conditions (Q385383) (← links)
- Decomposition of certain complete bipartite graphs into prisms (Q505465) (← links)
- Labelings in Cayley digraphs (Q607377) (← links)
- On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph (Q658053) (← links)
- On the number of unlabeled vertices in edge-friendly labelings of graphs (Q658097) (← links)
- On graceful spider graphs with at most four legs of lengths greater than one (Q670265) (← links)
- Constructions for cyclic Moebius ladder systems (Q712219) (← links)
- Embedding an arbitrary tree in a graceful tree (Q726528) (← links)
- The smallest non-autograph (Q726638) (← links)
- Not all partial cubes are \(\Theta \)-graceful (Q785832) (← links)
- On k-graceful, locally finite graphs (Q790132) (← links)
- \(\alpha\)-labeling number of trees (Q856879) (← links)
- Bi-cyclic decompositions of complete graphs into spanning trees (Q878620) (← links)
- Counting graceful labelings of trees: a theoretical and empirical study (Q897585) (← links)
- A parallel fast boundary element method using cyclic graph decompositions (Q907583) (← links)
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963) (← links)
- Simply sequentially additive labelings of 2-regular graphs (Q965975) (← links)
- Decompositions of complete graphs into blown-up cycles \(C_m\)[2] (Q966036) (← links)
- Further results on \((v,4,1)\)-perfect difference families (Q973130) (← links)
- Factorization of \(K_{n,n}\) into \((0,j)\)-prisms (Q989530) (← links)
- Trees having an even or quasi even degree sequence are graceful (Q1001089) (← links)
- On explicit formulas for bandwidth and antibandwidth of hypercubes (Q1026164) (← links)
- A substitution theorem for graceful trees and its applications (Q1043540) (← links)
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph (Q1044940) (← links)
- Spanning cubic graph designs (Q1045074) (← links)
- Applications of additive sequence of permutations (Q1045183) (← links)
- On k-graceful, countably infinite graphs (Q1078581) (← links)
- Strongly graceful graphs (Q1141665) (← links)
- Products of graceful trees (Q1147711) (← links)
