Decomposition into two trees with orientation constraints

DOI10.1016/j.disopt.2013.12.002zbMath1308.05100arXiv1304.3613OpenAlexW2047840586MaRDI QIDQ2339817

Olivier Durand de Gevigney

Publication date: 9 April 2015

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.3613

zbMATH Keywords

spanning treesgraphs orientation

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• On the degrees of the vertices of a directed graph
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• The complexity of satisfiability problems