Delta-system decompositions of graphs (Q1356709)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1019065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Delta-system decompositions of graphs |
scientific article; zbMATH DE number 1019065 |
Statements
Delta-system decompositions of graphs (English)
0 references
4 January 1998
0 references
A graph \(G\) has a decomposition into graphs \(G_1,\dots,G_t\), if \(G\) is an edge-disjoint union of graphs each of which is isomorphic to some graph \(G_i\). Let \(c\) be a fixed positive integer. The main result of the paper states that the problem to decide whether a graph \(G\) has an edge decompositions into graphs \(K_{1,c}\) and \(cK_2\) (the only two \(\Delta\)-systems of size \(c\) in the case of graphs) is in the class P.
0 references
delta-system
0 references
0.7970526814460754
0 references
0.7898670434951782
0 references
