Strongly Hamiltonian-connected locally semicomplete digraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199605)22:1<65::AID-JGT9>3.0.CO;2-J" /><65::AID-JGT9>3.0.CO;2-J 10.1002/(SICI)1097-0118(199605)22:1<65::AID-JGT9>3.0.CO;2-JzbMath0849.05030OpenAlexW4239026926MaRDI QIDQ4879168

Yubao Guo

Publication date: 3 November 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199605)22:1<65::aid-jgt9>3.0.co;2-j

zbMATH Keywords

tournamentsemicomplete digraphlocally semicomplete digraphsstrongly Hamiltonian-connected

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Path-connectivity in local tournaments ⋮ Trail-connected tournaments ⋮ Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments ⋮ Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs ⋮ \(H\)-force sets of locally semicomplete digraphs ⋮ Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Locally Semicomplete Digraphs and Generalizations

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