On colored designs. I
type: Item
instance of: scholarly article
title: On colored designs. I
zbMATH Open document ID: 0913.05009
DOI: 10.1016/S0012-365X(96)00042-8
author: J. Schönheim
author: Yair Caro
author: Yehuda Roditty
published in: Discrete Mathematics
publication date: 1999-05-31T00:00:00Z
review text: A graph \(G=(V,E)\) is said to have an \(H\)-decomposition if \(E\) is partitioned into \(E_1,E_2,\dots,E_k\) such that the edge-induced subgraphs \(G[E_i]\), \(i=1,2,\dots,k\), are all isomorphic to \(H\). The set \(\{E_i\mid 1\leq i\leq k\}\) is called an \(H\)-design for \(G\). In this paper, the problem of whether or not the existence of an \(H\)-design for a graph implies the existence of the corresponding colored designs is solved for small graphs \(H\) in the case of two or three edge colors.
reviewed by: Yanpei Liu
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05B30
zbMATH DE Number: 1019053
zbMATH Keywords: graph
zbMATH Keywords: \(H\)-design
zbMATH Keywords: colored designs
MaRDI profile type: Publication
cites work: Incomplete idempotent Schröder quasigroups and related packing designs
cites work: 3K2-decomposition of a graph
cites work: Q5543326
cites work: On colored designs. II
cites work: Edge-coloured designs with block size four
cites work: Parallel concepts in graph theory
cites work: Q4288120
cites work: Q3030837
cites work: Q3905297
cites work: Decomposition of complete multigraphs into stars
cites work: Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
cites work: Q3974839
full work available at URL: s0012-365x(96)00042-8
OpenAlex ID: W4212993584
description: scientific article; zbMATH DE number 1019053