scientific article; zbMATH DE number 3517174
From MaRDI portal
Publication:4097307
zbMATH Open0331.05021MaRDI QIDQ4097307FDOQ4097307
Authors: Jean-Claude Bermond, D. Sotteau
Publication date: 1976
Title of this publication is not available (Why is that?)
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Graph theory (05C99)
Cited In (34)
- On resolvable multipartite \(G\)-designs. II
- Decomposition of \(K_n\) into circuits of odd length
- Graceful labelling: state of the art, applications and future directions
- Strongly graceful graphs
- Decompositions of complete graphs into isomorphic cubes
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
- Resolvable decomposition of \(K^*_n\)
- Trees having an even or quasi even degree sequence are graceful
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Multigraph decomposition into stars and into multistars
- Every graph is an induced isopart of a circulant
- Graceful pairings
- Petersen graph decompositions of complete multipartite graphs
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Decomposition of complete multigraphs into stars
- Generating graceful trees from caterpillars by recursive attachment
- Degree- and orbit-balanced \(\Gamma \)-designs when \(\Gamma \) has five vertices
- \(G\)-designs and related designs
- On the cyclomatic number of a hypergraph
- Decomposition of large uniform hypergraphs
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial
- Balanced directed cycle designs based on groups
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- A guide to the graph labeling zoo
- Tight embeddings of partial quadrilateral packings
- Decomposition of the complete bipartite multigraph into cycles and stars
- Resolvable Mendelsohn designs and finite Frobenius groups
- A survey on the existence ofG-Designs
- NP-completeness of graph decomposition problems
- Computer search for graceful labeling: a survey
- Tree-designs with balanced-type conditions
- Decompositions of triangle-free 5-regular graphs into paths of length five
- 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
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)