Decomposition of bipartite graphs into special subgraphs
type: Item
instance of: scholarly article
title: Decomposition of bipartite graphs into special subgraphs
zbMATH Open document ID: 1114.05078
author: Guantao Chen
author: R. H. Schelp
published in: Discrete Applied Mathematics
publication date: 2007-03-02T00:00:00Z
review text: Let \(H\) be a subgraph of a graph \(G\) and \(F\) be a graph. A decomposition of \(G\) into subgraphs \(F_1,F_2,\dots,F_m\) is called an \(F\)-factorization of \(G\) orthogonal to \(H\) if \(F_i\cong F\) and \(| E(F_i\cap H)| =1\) for \(i=1,2,\dots,m\). The authors study graphs \(H\) for which the complete bipartite graph \(K_{4k,4k}\) has a \(C_4\)-factorization orthogonal to \(H\).
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5130479
zbMATH Keywords: orthogonal factorization
zbMATH Keywords: complete bipartite graphs
reviewed by: Brian Alspach
MaRDI profile type: Publication
full work available at URL: j.dam.2006.06.011
OpenAlex ID: W2162801091
cites work: Q4026144
cites work: A communication problem and directed triple systems
cites work: Q5620621
cites work: Q5311854
DOI: 10.1016/J.DAM.2006.06.011
description: scientific article; zbMATH DE number 5130479