Covering the edges of a connected graph by paths
type: Item
instance of: scholarly article
title: Covering the edges of a connected graph by paths
zbMATH Open document ID: 0840.05071
published in: Journal of Combinatorial Theory. Series B
publication date: 1996-06-27T00:00:00Z
review text: An edge cover of a graph \(G\) by paths is a set of paths so that every edge of \(G\) lies in at least one path. The author proves that every graph \(G\) of order \(n\) can be edge-covered by \({n\over 2}+ O(n^{3/4})\) paths.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 839141
zbMATH Keywords: path decomposition
zbMATH Keywords: edge cover
zbMATH Keywords: path
author: Laszló Pyber
reviewed by: Brian Alspach
MaRDI profile type: Publication
full work available at URL: jctb.1996.0012
OpenAlex ID: W2056587530
DOI: 10.1006/JCTB.1996.0012
description: scientific article; zbMATH DE number 839141