Small degree out‐branchings

DOI10.1002/jgt.10092zbMath1018.05041OpenAlexW2604625050MaRDI QIDQ4805223

Anders Yeo, Jörgen Bang-Jensen, Steéphan Thomassé

Publication date: 11 May 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10092

zbMATH Keywords

connectivityspanning treebranchingsmaximum degreeacyclic digraphout-branchingsmall degreearc-disjoint branchingsin-branching\(k\)-arc-strong

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

Good orientations of unions of edge‐disjoint spanning trees ⋮ Good acyclic orientations of 4‐regular 4‐connected graphs ⋮ Approximating directed weighted-degree constrained networks ⋮ Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs ⋮ Arc-disjoint paths and trees in 2-regular digraphs ⋮ Decomposing graphs into paths of fixed length ⋮ Approximating Directed Weighted-Degree Constrained Networks ⋮ \(k\)-distinct in- and out-branchings in digraphs ⋮ Complexity of some arc-partition problems for digraphs ⋮ Acyclic Digraphs ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees ⋮ Balanced branchings in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
• Spanning trees with bounded degrees
• Degree-preserving spanning trees in small-degree graphs
• Low-degree minimum spanning trees
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Efficient algorithms for a family of matroid intersection problems
• Topological design of centralized computer networks—formulations and algorithms
• A good algorithm for smallest spanning trees with a degree constraint
• Approximating the Minimum-Degree Steiner Tree to within One of Optimal
• Approximation algorithms for degree-constrained minimum-cost network-design problems

This page was built for publication: Small degree out‐branchings