Perfect out-forest problem and directed Steiner cycle packing problem

DOI10.1016/J.DAM.2025.01.027MaRDI QIDQ7021382zbMATH OpenFDO

Authors Yuefang Sun, Zemin Jin

Publication date 28 February 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.01.027

zbMATH Keywords

acyclic digraphdigraph packingdirected Steiner cycle packingEulerian digraphperfect out-forestsemicomplete digraphsymmetric digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Digraphs
• Directed Steiner tree packing and directed tree connectivity
• Generalized Connectivity of Graphs
• Graph minors. XIII: The disjoint paths problem
• Hardness and approximation results for packing Steiner trees
• scientific article; zbMATH DE number 1321108 (Why is no real title available?)
• Note on Perfect Forests
• Note on Perfect Forests in Digraphs
• On induced subgraphs with all degree odd
• Packing Steiner Trees: Separation Algorithms
• Packing strong subgraph in digraphs
• Perfect forests in graphs and their extensions
• Strong subgraph k‐connectivity
• Strong subgraph connectivity of digraphs
• The complexity of satisfiability problems
• The Steiner tree packing problem in VLSI design
• Two short proofs of the Perfect Forest Theorem

Cited in

(1)

• Compositions of digraphs: a survey

This page was built for publication: Perfect out-forest problem and directed Steiner cycle packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021382)