Gallai's conjecture for disconnected graphs
type: Item
instance of: scholarly article
title: Gallai's conjecture for disconnected graphs
zbMATH Open document ID: 0943.05067
DOI: 10.1016/S0012-365X(99)00167-3
author: Nathaniel Dean
author: Mekkia Kouider
published in: Discrete Mathematics
publication date: 2000-08-28T00:00:00Z
review text: 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.
reviewed by: Fedor V. Fomin
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1420374
zbMATH Keywords: Gallai's conjecture
zbMATH Keywords: path number
zbMATH Keywords: cycle number
zbMATH Keywords: graph decomposition
Wikidata QID: Q122887990
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1420374