Decomposition into two trees with orientation constraints
type: Item
instance of: scholarly article
title: Decomposition into two trees with orientation constraints
zbMATH Open document ID: 1308.05100
author: Olivier Durand de Gevigney
published in: Discrete Optimization
publication date: 2015-04-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/1304.3613
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6423609
zbMATH Keywords: spanning trees
zbMATH Keywords: graphs orientation
MaRDI profile type: Publication
OpenAlex ID: W2047840586
arXiv ID: 1304.3613
cites work: On the degrees of the vertices of a directed graph
cites work: Q3085455
cites work: On the Problem of Decomposing a Graph into n Connected Factors
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Q5593828
cites work: The complexity of satisfiability problems
DOI: 10.1016/J.DISOPT.2013.12.002
Recommended article: Tree-compositions and orientations
Recommended article: The decomposition of trees into subtrees
Recommended article: Tree decomposition
Recommended article: On the shape of decomposable trees
Recommended article: Decompositions of graphs into trees
Recommended article: Decomposition of some planar graphs into trees
Recommended article: Orthogonal Tree Decompositions of Graphs
Recommended article: Decomposition of complete graphs into arbitrary trees
Recommended article: On the decomposition dimension of trees
Recommended article: Tree decomposition of graphs
description: scientific article