Degree Conditions for H-Linked Digraphs
From MaRDI portal
Publication:5397726
DOI10.1017/S0963548313000278zbMath1282.05051OpenAlexW2054482621MaRDI QIDQ5397726
Michael Ferrara, Florian Pfender, Michael S. Jacobson
Publication date: 24 February 2014
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548313000278
Related Items (2)
A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs ⋮ One-to-one disjoint path covers in digraphs
Cites Work
- \(k\)-linked and \(k\)-cyclic digraphs
- Minimum degree conditions for \(H\)-linked graphs
- Highly connected non-2-linked digraphs
- On \(H\)-linked graphs
- New Ore-Type Conditions for H-Linked Graphs
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- Onk-ordered Hamiltonian graphs
- On Minimum Degree Implying That a Graph is H‐Linked
- On H‐immersions
This page was built for publication: Degree Conditions for H-Linked Digraphs