Decomposing highly connected graphs into paths of length five
type: Item
instance of: scholarly article
title: Decomposing highly connected graphs into paths of length five
zbMATH Open document ID: 1387.05189
published in: Discrete Applied Mathematics
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6872415
zbMATH Keywords: tree decomposition conjecture
zbMATH Keywords: decomposition of highly connected graphs
zbMATH Keywords: decomposition of graphs into paths
zbMATH Keywords: decomposition conjecture of Barát and Thomassen
author: F. Botler
author: G. O. Mota
author: M. T. I. Oshiro
author: Yoshiko Wakabayashi
MaRDI profile type: Publication
full work available at URL: j.dam.2016.08.001
OpenAlex ID: W2507265545
cites work: Factors and factorizations of graphs. Proof techniques in factor theory
cites work: Edge-decomposition of graphs into copies of a tree with four edges
cites work: Claw‐decompositions and tutte‐orientations
cites work: Q4398864
cites work: Perfect path double covers of graphs
cites work: Decomposing highly edge-connected graphs into paths of any given length
cites work: Decomposing regular graphs with prescribed girth into paths of given length
cites work: Decompositions of highly connected graphs into paths of any given length
cites work: Decompositions of highly connected graphs into paths of length five
cites work: Path decompositions of regular graphs with prescribed girth
cites work: Decompositions of triangle-free 5-regular graphs into paths of length five
cites work: Trois Types De Décompositions D'un Graphe En Chaînes
cites work: Q3577833
cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
cites work: Regular path decompositions of odd regular graphs
cites work: P4-decompositions of regular graphs
cites work: Q3807237
cites work: From the theory of regular graphs of third and fourth degree
cites work: Nowhere-zero 3-flows and modulo \(k\)-orientations
cites work: A Reduction Method for Edge-Connectivity in Graphs
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Connected Detachments of Graphs and Generalized Euler Trails
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
cites work: On the Problem of Decomposing a Graph into n Connected Factors
DOI: 10.1016/J.DAM.2016.08.001
description: scientific article; zbMATH DE number 6872415