Decomposition of bipartite graphs into special subgraphs (Q868396)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposition of bipartite graphs into special subgraphs |
scientific article; zbMATH DE number 5130479
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of bipartite graphs into special subgraphs |
scientific article; zbMATH DE number 5130479 |
Statements
Decomposition of bipartite graphs into special subgraphs (English)
0 references
2 March 2007
0 references
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\).
0 references
orthogonal factorization
0 references
complete bipartite graphs
0 references
