Every finite strongly connected digraph of stability 2 has a Hamiltonian path
From MaRDI portal
Publication:1837203
DOI10.1016/0012-365X(83)90188-7zbMath0507.05036OpenAlexW1990731595MaRDI QIDQ1837203
C. C. Chen, P. jun. Manalastas
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(83)90188-7
Related Items (14)
A short proof of the Chen-Manalastas theorem ⋮ Variations on the Gallai-Milgram theorem ⋮ Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 ⋮ A linear bound towards the traceability conjecture ⋮ Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture ⋮ Traceability of \(k\)-traceable oriented graphs ⋮ Stable set meeting every longest path ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ Cycle Partitions in Graphs ⋮ Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture ⋮ Non-separating spanning trees and out-branchings in digraphs of independence number 2
Cites Work
This page was built for publication: Every finite strongly connected digraph of stability 2 has a Hamiltonian path
