Pages that link to "Item:Q3528164"
From MaRDI portal
The following pages link to A survey on the existence of<i>G</i>-Designs (Q3528164):
Displaying 50 items.
- Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575) (← links)
- Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges (Q293622) (← links)
- Archimedean graph designs (Q385374) (← links)
- Tree-designs with balanced-type conditions (Q385383) (← links)
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching (Q400365) (← links)
- Decomposing the complete graph into dodecahedra (Q413339) (← links)
- Archimedean graph designs. II. (Q526249) (← links)
- Petersen graph decompositions of complete multipartite graphs (Q604998) (← links)
- On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph (Q658053) (← links)
- Exact embedding of two \(G\)-designs into a \((G+e)\)-design (Q658086) (← links)
- Packing paths in complete graphs (Q965248) (← links)
- Optical grooming with grooming ratio eight (Q967318) (← links)
- Graph designs for the eight-edge five-vertex graphs (Q1045180) (← links)
- 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 (Q1678094) (← links)
- On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs (Q1687833) (← links)
- Equipartite gregarious connected \((5,5)\)-graph systems (Q1709545) (← links)
- Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs (Q1800406) (← links)
- Decomposition of complete graphs into arbitrary trees (Q2042202) (← links)
- The spectrum problem for the connected cubic graphs of order 10 (Q2042609) (← links)
- Inequalities for doubly nonnegative functions (Q2227828) (← links)
- On decomposing regular graphs into isomorphic double-stars (Q2259570) (← links)
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs (Q2311707) (← links)
- On decomposing the complete symmetric digraph into orientations of \(K_4 - e\) (Q2312061) (← links)
- Decomposition of the complete bipartite multigraph into cycles and stars (Q2342622) (← links)
- On \(\sigma \)-tripartite labelings of odd prisms and even Möbius ladders (Q2421380) (← links)
- On the non-existence of pair covering designs with at least as many points as blocks (Q2428629) (← links)
- On cyclic decompositions of the complete graph into the bipartite generalized Petersen graph \(P ( n , 3 )\) (Q2659250) (← links)
- The Existence and Construction of (<i>K</i><sup>5</sup>∖<i>e</i>)-Designs of Orders 27, 135, 162, and 216 (Q2842261) (← links)
- Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices (Q2864794) (← links)
- Cops and Robbers on Graphs Based on Designs (Q2864796) (← links)
- On Decomposing the Complete Graph into the Union of Two Disjoint Cycles (Q2946050) (← links)
- Resolvable G-designs of order v and index {\lambda} (Q2981118) (← links)
- The nonexistence of a (<i>K</i><sub>6</sub>-<i>e</i>)-decomposition of the complete graph<i>K</i><sub>29</sub> (Q3576966) (← links)
- The spectrum problem for digraphs of order 4 and size 5 (Q4554802) (← links)
- (Q4616112) (← links)
- On Cyclic Decompositions of Complete Graphs into Tripartite Graphs (Q4908825) (← links)
- Multidesigns for the graph pair formed by the 6-cycle and 3-prism (Q4957977) (← links)
- Designs for graphs with six vertices and ten edges (Q5009961) (← links)
- Designs for graphs with six vertices and ten edges -- II (Q5061402) (← links)
- On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4 (Q5061701) (← links)
- Packings and Coverings of the Complete Bipartite Graph by Octagons (Q5069682) (← links)
- Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles (Q5106710) (← links)
- (Q5139693) (← links)
- A complete solution to the spectrum problem for graphs with six vertices and up to nine edges (Q5149412) (← links)
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676) (← links)
- (Q5374227) (← links)
- (Q5374251) (← links)
- Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs (Q5411944) (← links)
- Structured Codes of Graphs (Q5883294) (← links)
- Generalized pentagonal geometries. II (Q6611795) (← links)