scientific article; zbMATH DE number 3710196

MaRDI QIDQ3901534zbMATH OpenFDO

Authors Yair Caro, J. Schönheim

Publication date 1980

zbMATH Keywords

decompositionsG-designs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(18)

• Packing and covering of the complete graph with a graph G of four vertices or less
• The reconstruction of a tree from its number deck
• Isomorphic factorizations VIII: Bisectable trees
• Randomly decomposable graphs
• NP-completeness of graph decomposition problems
• Random packings of graphs
• Index of parameters of iterated line graphs
• A short update on equipackable graphs
• Smaller embeddings of partial \(k\)-star decompositions
• Grooming for two-period optical networks
• 3K2-decomposition of a graph
• On rooted packings, decompositions, and factors of graphs
• scientific article; zbMATH DE number 2230233 (Why is no real title available?)
• Research problems
• Characterization of P₃ P₂-equipackable graphs with 3m (m 1) edges
• Completing partial k-star designs
• Decomposing random regular graphs into stars
• All \(P_{3}\)-equipackable graphs

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