The following pages link to (Q5345646):
Displaying 38 items.
- Towards optimal embedding of an arbitrary tree in a graceful tree (Q324915) (← links)
- Generating graceful trees from caterpillars by recursive attachment (Q327636) (← links)
- Embedding an arbitrary tree in a graceful tree (Q726528) (← links)
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\) (Q855298) (← links)
- Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\) (Q878054) (← links)
- On the existence of elementary Abelian cycle systems (Q1043796) (← links)
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph (Q1044940) (← links)
- Packing and covering of the complete graph with a graph G of four vertices or less (Q1055440) (← links)
- Difference systems, graph designs, and coloring problems (Q1151903) (← links)
- Decompositions of complete graphs into isomorphic cubes (Q1170266) (← links)
- Graceful 2-regular graphs and Skolem sequences (Q1182884) (← links)
- Another class of balanced graph designs: Balanced circuit designs (Q1217809) (← links)
- Edge partitions of complete multipartite graphs into equal length circuits (Q1220088) (← links)
- Decomposition of the complete directed graph into k-circuits (Q1232420) (← links)
- Decomposition of \(K_n\) into circuits of odd length (Q1239166) (← links)
- \(G\)-decomposition of \(K_n\), where G has four vertices or less (Q1245839) (← links)
- Neighbor designs (Q1257019) (← links)
- A guide to the graph labeling zoo (Q1327231) (← links)
- Maximum packings with odd cycles (Q1332431) (← links)
- All 2-regular graphs consisting of 4-cycles are graceful (Q1343243) (← links)
- Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\) (Q1363688) (← links)
- The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles (Q1382820) (← links)
- Cyclic Hamiltonian cycle systems of the complete graph. (Q1428516) (← links)
- \(G\)-designs and related designs (Q1802138) (← links)
- On the harmonious chromatic number of a graph (Q1823253) (← links)
- Cyclically decomposing the complete graph into cycles (Q1827757) (← links)
- On the cyclic decomposition of complete graphs into almost-bipartite graphs (Q1876676) (← links)
- Pack graphs with subgraphs of size three (Q1990360) (← 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)
- Colouring even cycle systems (Q2470468) (← links)
- Maximum cyclic 4-cycle packings of the complete multipartite graph (Q2471047) (← links)
- Some constructions for cyclic perfect cycle systems (Q2568471) (← links)
- Generating graceful unicyclic graphs from a given forest (Q5154631) (← links)
- Binomial trees are graceful (Q5154634) (← links)
- Mutually orthogonal cycle systems (Q5871595) (← links)
- (Q6078007) (← links)
- Cyclic cycle systems of the complete multipartite graph (Q6185560) (← links)
