scientific article
From MaRDI portal
Publication:3901557
zbMath0454.05053MaRDI QIDQ3901557
Jean-Claude Bermond, Charlotte Huang, Dominique Sotteau, Alexander Rosa
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Coverings of a complete graph with five-vertex and five-edge graphs ⋮ Decomposition of complete multigraphs into crown graphs ⋮ The spectrum problem for digraphs of order 4 and size 5 ⋮ Computer search for graceful labeling: a survey ⋮ Tree-designs with balanced-type conditions ⋮ On the existence of \(k\)-sun systems ⋮ A survey on the existence ofG-Designs ⋮ Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord. ⋮ Packings and coverings of various complete graphs with the 4-cycle with a pendant edge ⋮ Pack graphs with subgraphs of size three ⋮ Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs ⋮ Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges ⋮ Optical grooming with grooming ratio eight ⋮ Packing of \(K_{v}\) with certain graphs of five vertices ⋮ Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\) ⋮ Decomposition of \(\lambda K_v\) into some graph with six vertices and seven edges ⋮ Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Graph designs for all graphs with six vertices and eight edges ⋮ On decomposing the complete symmetric digraph into orientations of \(K_4 - e\) ⋮ The Existence and Construction of (K5∖e)-Designs of Orders 27, 135, 162, and 216 ⋮ Graph designs for the eight-edge five-vertex graphs ⋮ Enumeration of small nonisomorphic pentagonal packings ⋮ A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks ⋮ Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices
This page was built for publication:
