scientific article; zbMATH DE number 3517174

zbMath0331.05021MaRDI QIDQ4097307

Dominique Sotteau, Jean-Claude Bermond

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Graph theory (05C99)

Related Items (34)

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

This page was built for publication: