A survey on the existence ofG-Designs
From MaRDI portal
Publication:3528164
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Recommendations
Cites work
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- \(G\)-designs and related designs
- \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
- A dynamic survey of graph labeling
- A note on the decomposition of graphs into isomorphic matchings
- All trees of diameter five are graceful
- Another class of balanced graph designs: Balanced circuit designs
- Combinatorial Problems
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Cycles with a chord are graceful
- Decomposing complete graphs into cubes
- Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges.
- Decomposition of Kn into Dragons
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Decomposition of complete graphs into 5‐cubes
- Decomposition of complete graphs into stars
- Decomposition of complete multigraphs into stars
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decompositions of complete graphs into isomorphic cubes
- Existence of resolvable path designs
- Graph designs for all graphs with six vertices and eight edges
- Graph designs for the eight-edge five-vertex graphs
- scientific article; zbMATH DE number 994577 (Why is no real title available?)
- scientific article; zbMATH DE number 3650602 (Why is no real title available?)
- scientific article; zbMATH DE number 3815667 (Why is no real title available?)
- scientific article; zbMATH DE number 3906543 (Why is no real title available?)
- scientific article; zbMATH DE number 4061255 (Why is no real title available?)
- scientific article; zbMATH DE number 3710227 (Why is no real title available?)
- scientific article; zbMATH DE number 3503285 (Why is no real title available?)
- scientific article; zbMATH DE number 3517174 (Why is no real title available?)
- scientific article; zbMATH DE number 3542447 (Why is no real title available?)
- scientific article; zbMATH DE number 1011065 (Why is no real title available?)
- scientific article; zbMATH DE number 1051286 (Why is no real title available?)
- scientific article; zbMATH DE number 1123805 (Why is no real title available?)
- scientific article; zbMATH DE number 1156630 (Why is no real title available?)
- scientific article; zbMATH DE number 2028650 (Why is no real title available?)
- scientific article; zbMATH DE number 2059946 (Why is no real title available?)
- scientific article; zbMATH DE number 1471083 (Why is no real title available?)
- scientific article; zbMATH DE number 3794094 (Why is no real title available?)
- scientific article; zbMATH DE number 1885943 (Why is no real title available?)
- scientific article; zbMATH DE number 2108144 (Why is no real title available?)
- scientific article; zbMATH DE number 822734 (Why is no real title available?)
- scientific article; zbMATH DE number 890666 (Why is no real title available?)
- scientific article; zbMATH DE number 2188324 (Why is no real title available?)
- scientific article; zbMATH DE number 2188475 (Why is no real title available?)
- scientific article; zbMATH DE number 3258069 (Why is no real title available?)
- scientific article; zbMATH DE number 3333906 (Why is no real title available?)
- scientific article; zbMATH DE number 3392464 (Why is no real title available?)
- scientific article; zbMATH DE number 3104192 (Why is no real title available?)
- Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
- Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs
- Minimizing drop cost for SONET/WDM networks with 18 wavelength requirements
- Modular gracious labellings of trees
- New designs with block size 7
- On -labeling the union of three cycles
- On claw-decomposition of complete graphs and complete bigraphs
- On diagonal cycle systems
- On resolvable designs
- On resolvable tree-decompositions of complete graphs
- On the construction of odd cycle systems
- On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
- On the cyclic decomposition of complete graphs into bipartite graphs
- On the spectrum for Km+2 \ Km designs
- Packing trees of bounded diameter into the complete graph
- Pair covering and other designs with block size 6
- Resolvable balanced bipartite designs
- Some maximal arcs in finite projective planes
- Some new BIBDS with ? = 1 and 6 ?k ? 10
- Some new BIBDs with block size 7
- Some new bibds with k = 6 and λ = 1
- Spanning cubic graph designs
- Strongly graceful graphs
- The Coarseness of the Complete Graph
- The Existence and Construction of Balanced Incomplete Block Designs
- The Non-Existence of Finite Projective Planes of Order 10
- The Nonexistence of Certain Finite Projective Planes
- The Oberwolfach problem and factors of uniform odd length cycles
- The spectrum problem for the Petersen graph
- There is no (46, 6, 1) block design
- Two-factorisations of complete graphs of orders fifteen and seventeen
Cited in
(72)- Rotatable designs and \(\mathcal G\)-weakly invariant designs
- Graph designs for the eight-edge five-vertex graphs
- Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles
- On -fold Rosa-type labelings of bipartite multigraphs
- Equipartite gregarious connected (5,5)-graph systems
- Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs
- \(G\)-designs and related designs
- Decomposition of complete graphs into arbitrary trees
- The spectrum problem for the connected cubic graphs of order 10
- Inequalities for doubly nonnegative functions
- On decomposing regular graphs into isomorphic double-stars
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
- On decomposing the complete symmetric digraph into orientations of \(K_4 - e\)
- Decomposition of the complete bipartite multigraph into cycles and stars
- On \(\sigma \)-tripartite labelings of odd prisms and even Möbius ladders
- On the non-existence of pair covering designs with at least as many points as blocks
- On cyclic decompositions of the complete graph into the bipartite generalized Petersen graph \(P ( n , 3 )\)
- Decompositions of complete graphs into bipartite 2-regular subgraphs
- The existence and construction of \((K_{5}\setminus e)\)-designs of orders 27, 135, 162, and 216
- Degree- and orbit-balanced -designs when has five vertices
- Cops and robbers on graphs based on designs
- Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
- On decomposing the complete graph into the union of two disjoint cycles
- Resolvable G-designs of order v and index {\lambda}
- The proportion of various graphs in graph-designs
- The nonexistence of a \((K_6-e)\)-decomposition of the complete graph \(K_{29}\)
- Archimedean graph designs
- Tree-designs with balanced-type conditions
- Designs, adjacency multigraphs and embeddings: A survey
- scientific article; zbMATH DE number 17515 (Why is no real title available?)
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
- Decomposing the complete graph into dodecahedra
- scientific article; zbMATH DE number 1229600 (Why is no real title available?)
- scientific article; zbMATH DE number 2061156 (Why is no real title available?)
- scientific article; zbMATH DE number 1792569 (Why is no real title available?)
- The spectrum problem for digraphs of order 4 and size 5
- 4-cycle decompositions of complete 3-uniform hypergraphs
- On cyclic decompositions of complete graphs into tripartite graphs
- Multidesigns for the graph pair formed by the 6-cycle and 3-prism
- Designs for graphs with six vertices and ten edges
- Designs for graphs with six vertices and ten edges -- II
- On maximum packings of \(\lambda \)-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4
- Packings and Coverings of the Complete Bipartite Graph by Octagons
- Maximum packings of the \(\lambda\)-fold complete 3-uniform hypergraph with loose 3-cycles
- scientific article; zbMATH DE number 7283879 (Why is no real title available?)
- A complete solution to the spectrum problem for graphs with six vertices and up to nine edges
- scientific article; zbMATH DE number 6433828 (Why is no real title available?)
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
- Archimedean graph designs. II.
- scientific article; zbMATH DE number 6857389 (Why is no real title available?)
- Completing the design spectra for graphs with six vertices and eight edges
- Decomposition of complete graphs into isomorphic complete bipartite graphs
- Structured Codes of Graphs
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Petersen graph decompositions of complete multipartite graphs
- scientific article; zbMATH DE number 7731175 (Why is no real title available?)
- On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph
- Exact embedding of two G-designs into a (G+e)-design
- Generalized pentagonal geometries. II
- Decomposing complete graphs into isomorphic complete multipartite graphs
- On decompositions of complete 3-uniform hypergraphs into a linear forest with 4 edges
- Cyclic decompositions of K_n into LWO graphs
- G-designs for the connected triangular bicyclic graphs with nine edges
- On cyclic P(4n, 2n - 1)-designs
- Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices
- Decomposition of -fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges
- On decompositions of the Johnson graph
- Decomposing the -fold complete 3-uniform hypergraph into the lines of the Pasch configuration
- The spectrum problem for the 4-uniform 4-colorable 3-cycles with maximum degree 2
- Design spectra for 6-regular graphs with 12 vertices
- Packing paths in complete graphs
- Optical grooming with grooming ratio eight
This page was built for publication: A survey on the existence ofG-Designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528164)
