The following pages link to (Q4097307):
Displaying 34 items.
- Generating graceful trees from caterpillars by recursive attachment (Q327636) (← links)
- Tree-designs with balanced-type conditions (Q385383) (← links)
- Petersen graph decompositions of complete multipartite graphs (Q604998) (← links)
- Graceful labelling: state of the art, applications and future directions (Q691624) (← links)
- Decomposition of large uniform hypergraphs (Q762500) (← links)
- Tight embeddings of partial quadrilateral packings (Q965225) (← links)
- Trees having an even or quasi even degree sequence are graceful (Q1001089) (← links)
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths (Q1066165) (← links)
- Decomposition of complete multigraphs into stars (Q1132885) (← links)
- Strongly graceful graphs (Q1141665) (← links)
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k (Q1153099) (← links)
- Edge partitions of the complete symmetric directed graph and related designs (Q1158162) (← links)
- Decompositions of complete graphs into isomorphic cubes (Q1170266) (← links)
- NP-completeness of graph decomposition problems (Q1179032) (← links)
- Balanced directed cycle designs based on groups (Q1182947) (← 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)
- On the cyclomatic number of a hypergraph (Q1257911) (← links)
- Resolvable decomposition of \(K^*_n\) (Q1259605) (← links)
- A guide to the graph labeling zoo (Q1327231) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge (Q1773359) (← links)
- \(G\)-designs and related designs (Q1802138) (← links)
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs (Q1838972) (← links)
- Decomposition of the complete bipartite multigraph into cycles and stars (Q2342622) (← links)
- Decompositions of triangle-free 5-regular graphs into paths of length five (Q2352046) (← links)
- Multigraph decomposition into stars and into multistars (Q2487986) (← links)
- On resolvable multipartite \(G\)-designs. II (Q2494125) (← links)
- Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices (Q2864794) (← links)
- A survey on the existence of<i>G</i>-Designs (Q3528164) (← links)
- RESOLVABLE MENDELSOHN DESIGNS AND FINITE FROBENIUS GROUPS (Q4576811) (← links)
- Every graph is an induced isopart of a circulant (Q4722109) (← links)
- Computer search for graceful labeling: a survey (Q5081235) (← links)
- (Q5206934) (← links)
