Decompositions of highly connected graphs into paths of length five
type: Item
instance of: scholarly article
title: Decompositions of highly connected graphs into paths of length five
zbMATH Open document ID: 1347.05106
author: M. T. I. Oshiro
author: Yoshiko Wakabayashi
author: F. Botler
author: G. O. Mota
publication date: 2016-10-17T00:00:00Z
full work available at URL: https://arxiv.org/abs/1505.04309
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6639895
zbMATH Keywords: edge decomposition
zbMATH Keywords: highly connected
zbMATH Keywords: path decomposition
MaRDI profile type: Publication
OpenAlex ID: W2963595382
arXiv ID: 1505.04309
cites work: Edge-decomposition of graphs into copies of a tree with four edges
cites work: Claw‐decompositions and tutte‐orientations
cites work: Decompositions of triangle-free 5-regular graphs into paths of length five
cites work: Q3577833
cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
cites work: Q3807237
cites work: Q5539649
cites work: Decompositions of highly connected graphs into paths of length 3
cites work: Edge-decompositions of highly connected graphs into paths
cites work: The weak 3-flow conjecture and the weak circular flow conjecture
cites work: Decomposing a graph into bistars
cites work: Decomposing graphs into paths of fixed length
DOI: 10.1016/J.ENDM.2015.07.036
description: scientific article; zbMATH DE number 6639895