Locally semicomplete digraphs that are complementarym-pancyclic

DOI<121::AID-JGT2>3.0.CO;2-T 10.1002/(SICI)1097-0118(199602)21:2<121::AID-JGT2>3.0.CO;2-TzbMath0845.05048OpenAlexW2056213724MaRDI QIDQ4865521

Yubao Guo, Lutz Volkmann

Publication date: 25 February 1996

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

zbMATH Keywords

digraphtournamentslocally semicomplete digraphs

Mathematics Subject Classification ID

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

Related Items (8)

A classification of locally semicomplete digraphs ⋮ Path-connectivity in local tournaments ⋮ A characterization of locally semicomplete CKI-digraphs ⋮ Weakly cycle complementary 3-partite tournaments ⋮ Cycle factors in strongly connected local tournaments ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ All regular multipartite tournaments that are cycle complementary ⋮ Locally Semicomplete Digraphs and Generalizations

This page was built for publication: Locally semicomplete digraphs that are complementarym-pancyclic