Gallai's conjecture for disconnected graphs (Q1970699)
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 1420374
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gallai's conjecture for disconnected graphs |
scientific article; zbMATH DE number 1420374 |
Statements
Gallai's conjecture for disconnected graphs (English)
0 references
28 August 2000
0 references
The authors prove that the minimum number of paths needed to partition the edge set of a graph is at most \( u/2 + \lfloor 2g/3 \rfloor\) where \(u\) is the number of vertices of odd degrees and \(g\) is the number of nonisolated vertices of even degrees.
0 references
Gallai's conjecture
0 references
path number
0 references
cycle number
0 references
graph decomposition
0 references
0.8438795804977417
0 references
0.8416695594787598
0 references
0.8382140398025513
0 references
0.829373836517334
0 references
