Internally-disjoint Pendant Steiner Trees in Digraphs
Fuente:
arXiv
Saved in:
| Main Authors: | Yu, Shanshan, Sun, Yuefang |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Arc-disjoint Steiner Cycles in Digraphs
by: Bai, Jie, et al.
Published: (2026)
by: Bai, Jie, et al.
Published: (2026)
Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
by: Yu, Shanshan, et al.
Published: (2026)
by: Yu, Shanshan, et al.
Published: (2026)
Steiner Type Packing Problems in Digraphs: A Survey
by: Sun, Yuefang
Published: (2022)
by: Sun, Yuefang
Published: (2022)
Degree conditions for disjoint path covers in digraphs
by: Ma, Ansong, et al.
Published: (2024)
by: Ma, Ansong, et al.
Published: (2024)
Constructing edge-disjoint Steiner trees in Cartesian product networks
by: Li, Rui, et al.
Published: (2023)
by: Li, Rui, et al.
Published: (2023)
Packing internally disjoint Steiner paths of data center networks
by: Zhu, Wen-Han, et al.
Published: (2024)
by: Zhu, Wen-Han, et al.
Published: (2024)
Constructing disjoint Steiner trees in Sierpiński graphs
by: Yang, Chenxu, et al.
Published: (2023)
by: Yang, Chenxu, et al.
Published: (2023)
Kings and Kernels in Semicomplete Compositions
by: Sun, Yuefang, et al.
Published: (2020)
by: Sun, Yuefang, et al.
Published: (2020)
On the supersaturation of oriented Turán problems
by: Hu, Xuanrui, et al.
Published: (2026)
by: Hu, Xuanrui, et al.
Published: (2026)
On oriented Turán problems
by: Gerbner, Dániel, et al.
Published: (2026)
by: Gerbner, Dániel, et al.
Published: (2026)
Cordiality of Digraphs
by: Beasley, Leroy, et al.
Published: (2021)
by: Beasley, Leroy, et al.
Published: (2021)
EKR-Type Theorems for Pendant Graph Constructions
by: Carrion, Michael, et al.
Published: (2025)
by: Carrion, Michael, et al.
Published: (2025)
Słupecki Digraphs
by: Kunos, Ádám, et al.
Published: (2024)
by: Kunos, Ádám, et al.
Published: (2024)
Digraph Yama Nim
by: Inoue, Hiyu, et al.
Published: (2025)
by: Inoue, Hiyu, et al.
Published: (2025)
The maximum number of cliques in disjoint copies of graphs
by: Gao, Zhipeng, et al.
Published: (2025)
by: Gao, Zhipeng, et al.
Published: (2025)
Spectra of Corona Products of Digraphs
by: Cavers, Michael, et al.
Published: (2025)
by: Cavers, Michael, et al.
Published: (2025)
The List Linear Arboricity of Digraphs
by: Shi, Yueping, et al.
Published: (2025)
by: Shi, Yueping, et al.
Published: (2025)
Spectra of Subdivision Products of Digraphs
by: Cavers, Michael, et al.
Published: (2026)
by: Cavers, Michael, et al.
Published: (2026)
Covering Random Digraphs with Hamilton Cycles
by: Ferber, Asaf, et al.
Published: (2024)
by: Ferber, Asaf, et al.
Published: (2024)
Structure of cycles in Minimal Strong Digraphs
by: Argudo, Miguel Arcos, et al.
Published: (2024)
by: Argudo, Miguel Arcos, et al.
Published: (2024)
Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)
by: Maheshwari, Anil, et al.
Published: (2026)
On the Steiner $k$-diameter and Steiner ($k,k^{\prime}$)-radius of trees
by: Zhang, Qingnan, et al.
Published: (2025)
by: Zhang, Qingnan, et al.
Published: (2025)
Packing edge disjoint cliques in graphs
by: Balogh, József, et al.
Published: (2025)
by: Balogh, József, et al.
Published: (2025)
Edge-disjoint linkage in infinite graphs
by: Assem, Amena, et al.
Published: (2025)
by: Assem, Amena, et al.
Published: (2025)
Extremal results on Berge disjoint paths
by: Zhao, Xiamiao, et al.
Published: (2025)
by: Zhao, Xiamiao, et al.
Published: (2025)
Note on Long Directed Cycles in Eulerian Digraphs
by: Ai, Jiangdong, et al.
Published: (2025)
by: Ai, Jiangdong, et al.
Published: (2025)
Colouring Complete Multipartite and Kneser-type Digraphs
by: Harutyunyan, Ararat, et al.
Published: (2023)
by: Harutyunyan, Ararat, et al.
Published: (2023)
Non-Hamiltonian 2-regular Digraphs -- Residues
by: Ramanath, Munagala V.
Published: (2026)
by: Ramanath, Munagala V.
Published: (2026)
Non-Hamiltonian 2-regular Digraphs
by: Ramanath, Munagala V. S.
Published: (2025)
by: Ramanath, Munagala V. S.
Published: (2025)
Digraph Branchings and Matrix Determinants
by: Ghosh, Sayani, et al.
Published: (2023)
by: Ghosh, Sayani, et al.
Published: (2023)
On partition and almost disjoint properties of combinatorial notions
by: Zhang, Teng
Published: (2025)
by: Zhang, Teng
Published: (2025)
Two conjectures on vertex-disjoint rainbow triangles
by: Liu, Xu, et al.
Published: (2025)
by: Liu, Xu, et al.
Published: (2025)
Latin cubes with disjoint subcubes of two orders
by: Kemp, Tara, et al.
Published: (2025)
by: Kemp, Tara, et al.
Published: (2025)
Note on disjoint faces in simple topological graphs
by: Zeng, Ji
Published: (2023)
by: Zeng, Ji
Published: (2023)
Edge-disjoint cycles with the same vertex set
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
Vertex-disjoint cycles of different lengths in tournaments
by: Bai, Yandong, et al.
Published: (2024)
by: Bai, Yandong, et al.
Published: (2024)
Latin squares with non-partitioning disjoint subsquares
by: Kemp, Tara
Published: (2026)
by: Kemp, Tara
Published: (2026)
Oriented Steiner Triple Systems, Steiner Products, and Dynamics
by: Kettinger, Jake, et al.
Published: (2025)
by: Kettinger, Jake, et al.
Published: (2025)
Extremal Problems for the Family of $k$-Strongly Connected Digraphs
by: Wang, Qinglin, et al.
Published: (2026)
by: Wang, Qinglin, et al.
Published: (2026)
Subdivisions of Oriented Cycles in Digraphs with Hamiltonian directed path
by: Alhakim, Abbas, et al.
Published: (2024)
by: Alhakim, Abbas, et al.
Published: (2024)
Similar Items
-
Arc-disjoint Steiner Cycles in Digraphs
by: Bai, Jie, et al.
Published: (2026) -
Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
by: Yu, Shanshan, et al.
Published: (2026) -
Steiner Type Packing Problems in Digraphs: A Survey
by: Sun, Yuefang
Published: (2022) -
Degree conditions for disjoint path covers in digraphs
by: Ma, Ansong, et al.
Published: (2024) -
Constructing edge-disjoint Steiner trees in Cartesian product networks
by: Li, Rui, et al.
Published: (2023)