The following pages link to (Q4044627):
Displaying 50 items.
- The gracefulness of the join of graphs. II (Q322012) (← links)
- The gracefulness of the join of graphs (Q324910) (← links)
- Towards optimal embedding of an arbitrary tree in a graceful tree (Q324915) (← links)
- Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation (Q324919) (← links)
- Some new families of graceful graphs (Q324931) (← links)
- Gracefully cultivating trees on a cycle (Q324938) (← 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)
- Generating graceful trees from caterpillars by recursive attachment (Q327636) (← links)
- On modular edge-graceful graphs (Q354418) (← links)
- Full friendly index set. I (Q385157) (← links)
- Super edge magic graceful graphs (Q508670) (← links)
- Two theorems on graceful trees (Q599066) (← links)
- Automorphic decompositions of graphs (Q659690) (← links)
- On partitional and other related graphs (Q691629) (← links)
- Embedding an arbitrary tree in a graceful tree (Q726528) (← links)
- The smallest non-autograph (Q726638) (← links)
- Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees (Q814305) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- Products of graceful trees (Q1147711) (← links)
- Difference systems, graph designs, and coloring problems (Q1151903) (← links)
- On k-sequential and other numbered graphs (Q1152385) (← links)
- Foreword to the special issue ``Advances in graph labelling'' (Q1182883) (← links)
- Strongly indexable graphs (Q1182885) (← links)
- Distinct distance sets in a graph (Q1182889) (← links)
- On Skolem graceful graphs (Q1182894) (← links)
- The harmonious coloring number of a graph (Q1182896) (← links)
- Labelings of a certain class of convex polytopes (Q1188047) (← links)
- On the graceful numbering of spanning trees (Q1214751) (← links)
- The factorial representation of balanced labelled graphs (Q1237745) (← links)
- A counterexample to a theorem of S. Piccard (Q1241448) (← links)
- An intermediate-value theorem for optimum tree valuation (Q1253929) (← links)
- On lower bounds for numbered complete graphs (Q1293201) (← links)
- Codings of graphs with binary edge labels (Q1323484) (← links)
- The joint sum of graceful trees (Q1324364) (← links)
- Decompositions into linear forests and difference labelings of graphs (Q1327218) (← links)
- All 2-regular graphs consisting of 4-cycles are graceful (Q1343243) (← links)
- Binary labeling of graphs (Q1359371) (← links)
- Graceful labelings of nearly complete graphs (Q1601392) (← links)
- On the beta-number of forests with isomorphic components (Q1649908) (← links)
- New parameters for studying graceful properties of graphs (Q1687832) (← links)
- (Di)graph products, labelings and related results (Q1687838) (← links)
- On the beta-number of linear forests with an even number of components (Q1713606) (← links)
- On the embedding of cone graphs in the line with distinct distances between neighbors (Q1728106) (← links)
- Sequentially additive graphs (Q1837706) (← links)
- On gracefully and harmoniously labeling zero-divisor graphs (Q2089479) (← links)
- Alpha labeling of cyclic graphs (Q2114946) (← links)
- Decomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\) (Q2142644) (← links)
- Orthogonal labeling for some different infinite graph classes (Q2143637) (← links)
