Weakly Hamiltonian-connected locally semicomplete digraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199602)21:2<163::AID-JGT5>3.0.CO;2-P" /><163::AID-JGT5>3.0.CO;2-P 10.1002/(SICI)1097-0118(199602)21:2<163::AID-JGT5>3.0.CO;2-PzbMath0845.05047OpenAlexW4255936197MaRDI QIDQ4865524

Lutz Volkmann, Yubao Guo, Jörgen Bang-Jensen

Publication date: 25 February 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<163::aid-jgt5>3.0.co;2-p

zbMATH Keywords

digraphtournamentslocally semicomplete digraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Path-connectivity in local tournaments ⋮ Trail-connected tournaments ⋮ Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments ⋮ Locally Semicomplete Digraphs and Generalizations

This page was built for publication: Weakly Hamiltonian-connected locally semicomplete digraphs