scientific article; zbMATH DE number 3517174

Cited in

(34)

\(G\)-decomposition of \(K_n\), where G has four vertices or less
On resolvable multipartite \(G\)-designs. II
Trees having an even or quasi even degree sequence are graceful
Decompositions of triangle-free 5-regular graphs into paths of length five
A guide to the graph labeling zoo
Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
Resolvable decomposition of \(K^*_n\)
Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge
Edge partitions of the complete symmetric directed graph and related designs
Decomposition of large uniform hypergraphs
\(G\)-designs and related designs
Graceful labelling: state of the art, applications and future directions
Balanced directed cycle designs based on groups
Every graph is an induced isopart of a circulant
Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
Graceful pairings
NP-completeness of graph decomposition problems
Computer search for graceful labeling: a survey
Decomposition of the complete bipartite multigraph into cycles and stars
Petersen graph decompositions of complete multipartite graphs
Tree-designs with balanced-type conditions
Decomposition of complete multigraphs into stars
Resolvable Mendelsohn designs and finite Frobenius groups
Strongly graceful graphs
Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
Generating graceful trees from caterpillars by recursive attachment
On the cyclomatic number of a hypergraph
Tight embeddings of partial quadrilateral packings
Multigraph decomposition into stars and into multistars
Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial
Decomposition of \(K_n\) into circuits of odd length
Degree- and orbit-balanced \(\Gamma \)-designs when \(\Gamma \) has five vertices
A survey on the existence ofG-Designs
Decompositions of complete graphs into isomorphic cubes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4097307)