scientific article; zbMATH DE number 3710227

Cited in

(35)

Graph designs for the eight-edge five-vertex graphs
Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord.
Enumeration of small nonisomorphic pentagonal packings
Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge
Coverings of a complete graph with five-vertex and five-edge graphs
Pack graphs with subgraphs of size three
On decomposing the complete symmetric digraph into orientations of \(K_4 - e\)
Decomposition of complete multigraphs into crown graphs
Packings and coverings of various complete graphs with the 4-cycle with a pendant edge
Decomposition of K_v into some graph with six vertices and seven edges
Graph designs for all graphs with six vertices and eight edges
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
A survey on the existence ofG-Designs
Tree-designs with balanced-type conditions
On the existence of k-sun systems
The spectrum problem for digraphs of order 4 and size 5
Computer search for graceful labeling: a survey
Decompositions of some regular graphs into unicyclic graphs of order five
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
Decomposition of complete graphs into isomorphic complete bipartite graphs
Graph theory (algorithmic, algebraic, and metric problems)
Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\)
Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs
Decomposing complete graphs into isomorphic complete multipartite graphs
Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices
Decomposition of complete graphs on \(n\equiv 0,1\pmod{14}\) vertices into disconnected unicyclic tripartite graphs on seven edges
Homogeneous mixed bowtie systems
Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges
Packing of \(K_{v}\) with certain graphs of five vertices
Decomposition of complete graphs into forests with six edges
Decomposition of a complete equipartite graph into gregarious \(\mathcal{Y}_5\) tree
Survey on balanced graph and hypergraph designs
Decomposition of complete graphs into disconnected bipartite graphs with seven edges and eight vertices
Optical grooming with grooming ratio eight

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 Q3901557)