Packing and covering of the complete graph with a graph G of four vertices or less
type: Item
instance of: scholarly article
title: Packing and covering of the complete graph with a graph G of four vertices or less
zbMATH Open document ID: 0521.05053
published in: Journal of Combinatorial Theory. Series A
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3823842
zbMATH Keywords: graph packing problem
zbMATH Keywords: graph covering problem
author: Yehuda Roditty
MaRDI profile type: Publication
cites work: Q5580172
cites work: \(G\)-decomposition of \(K_n\), where G has four vertices or less
cites work: Decomposition of complete graphs into stars
cites work: Q3901534
cites work: Graphs with forbidden subgraphs
cites work: Minimal coverings of pairs by triples
cites work: Q5345646
cites work: On the covering of pairs by quadruples. I
cites work: On the covering of pairs by quadruples. II
cites work: Q5522938
cites work: Packing and Covering of the Complete Graph with 4-Cycles*
cites work: On the decomposition of a graph into stars
description: scientific article; zbMATH DE number 3823842