Non-separating spanning trees and out-branchings in digraphs of independence number 2
From MaRDI portal
Publication:2102758
DOI10.1007/s00373-022-02589-6zbMath1502.05030arXiv2007.02834OpenAlexW4308784876MaRDI QIDQ2102758
Anders Yeo, Jörgen Bang-Jensen, Stéphane Bessy
Publication date: 29 November 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.02834
Hamiltonian pathspanning treesstrongly connecteddigraphs of independence number 2non-separating branching
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Arc-disjoint spanning sub(di)graphs in digraphs
- Edge-disjoint paths in digraphs with bounded independence number
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- On two minimax theorems in graph
- Small Ramsey numbers
- Disjoint paths in unions of tournaments
- Every finite strongly connected digraph of stability 2 has a Hamiltonian path
- Arc-disjoint paths and trees in 2-regular digraphs
- Arc‐disjoint strong spanning subdigraphs of semicomplete compositions
- Digraphs
- Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
This page was built for publication: Non-separating spanning trees and out-branchings in digraphs of independence number 2