Delta-system decompositions of graphs (Q1356709): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:02, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Delta-system decompositions of graphs |
scientific article |
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