A survey on the existence ofG-Designs

DOI10.1002/jcd.20170zbMath1168.05303OpenAlexW2030430467MaRDI QIDQ3528164

Darryn E. Bryant, Melinda Buchanan, Peter J. Adams

Publication date: 8 October 2008

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20170

zbMATH Keywords

survey\(G\)-designgraph decomposition

Mathematics Subject Classification ID

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)

Related Items (49)

Structured Codes of Graphs ⋮ Decompositions of complete graphs into bipartite 2-regular subgraphs ⋮ Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges ⋮ On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4 ⋮ The spectrum problem for digraphs of order 4 and size 5 ⋮ Packings and Coverings of the Complete Bipartite Graph by Octagons ⋮ On cyclic decompositions of the complete graph into the bipartite generalized Petersen graph \(P ( n , 3 )\) ⋮ Petersen graph decompositions of complete multipartite 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 ⋮ Archimedean graph designs ⋮ Tree-designs with balanced-type conditions ⋮ On Decomposing the Complete Graph into the Union of Two Disjoint Cycles ⋮ On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k\)-matching] ⋮ On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs ⋮ On \(\sigma \)-tripartite labelings of odd prisms and even Möbius ladders ⋮ Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles ⋮ Decomposing the complete graph into dodecahedra ⋮ On the non-existence of pair covering designs with at least as many points as blocks ⋮ Equipartite gregarious connected \((5,5)\)-graph systems ⋮ Unnamed Item ⋮ On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph ⋮ Exact embedding of two \(G\)-designs into a \((G+e)\)-design ⋮ Designs for graphs with six vertices and ten edges -- II ⋮ Inequalities for doubly nonnegative functions ⋮ On Cyclic Decompositions of Complete Graphs into Tripartite Graphs ⋮ Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs ⋮ Archimedean graph designs. II. ⋮ The nonexistence of a (K₆-e)-decomposition of the complete graphK₂₉ ⋮ Packing paths in complete graphs ⋮ Optical grooming with grooming ratio eight ⋮ On decomposing regular graphs into isomorphic double-stars ⋮ Multidesigns for the graph pair formed by the 6-cycle and 3-prism ⋮ Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs ⋮ Decomposition of complete graphs into arbitrary trees ⋮ The spectrum problem for the connected cubic graphs of order 10 ⋮ A complete solution to the spectrum problem for graphs with six vertices and up to nine edges ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs ⋮ On decomposing the complete symmetric digraph into orientations of \(K_4 - e\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Existence and Construction of (K⁵∖e)-Designs of Orders 27, 135, 162, and 216 ⋮ Graph designs for the eight-edge five-vertex graphs ⋮ Designs for graphs with six vertices and ten edges ⋮ A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks ⋮ Decomposition of the complete bipartite multigraph into cycles and stars ⋮ Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices ⋮ Cops and Robbers on Graphs Based on Designs

Cites Work

• A note on the decomposition of graphs into isomorphic matchings
• Existence of resolvable path designs
• Spanning cubic graph designs
• Graph designs for the eight-edge five-vertex graphs
• Decomposition of complete multigraphs into stars
• Strongly graceful graphs
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decompositions of complete graphs into isomorphic cubes
• On claw-decomposition of complete graphs and complete bigraphs
• Another class of balanced graph designs: Balanced circuit designs
• Resolvable balanced bipartite designs
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• New designs with block size 7
• \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
• A dynamic survey of graph labeling
• \(G\)-designs and related designs
• The Oberwolfach problem and factors of uniform odd length cycles
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Graph designs for all graphs with six vertices and eight edges
• On resolvable designs
• There is no (46, 6, 1) block design
• Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
• Cycle decompositions III: Complete graphs and fixed length cycles
• The Non-Existence of Finite Projective Planes of Order 10
• On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
• The Existence and Construction of Balanced Incomplete Block Designs
• On the construction of odd cycle systems
• On resolvable tree-decompositions of complete graphs
• Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
• Cycles with a chord are graceful
• Decomposition of K_n into Dragons
• Some new BIBDS with ? = 1 and 6 ?k ? 10
• On the spectrum for Km+2 \ Km designs
• Some new bibds with k = 6 and λ = 1
• Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs
• The spectrum problem for the Petersen graph
• Some new BIBDs with block size 7
• Pair covering and other designs with block size 6
• Decomposition of complete graphs into 5‐cubes
• Decomposing complete graphs into cubes
• The Coarseness of the Complete Graph
• Some maximal arcs in finite projective planes
• Decomposition of complete graphs into stars
• Combinatorial Problems
• The Nonexistence of Certain Finite Projective Planes
• All trees of diameter five are graceful
• Modular gracious labellings of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A survey on the existence ofG-Designs