On \(k\)-strong and \(k\)-cyclic digraphs

DOI10.1016/0012-365X(95)00300-LzbMath0873.05047OpenAlexW1967478916MaRDI QIDQ1356647

Anders Yeo, Gregory Gutin, Jörgen Bang-Jensen

Publication date: 10 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00300-l

zbMATH Keywords

digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc ⋮ A classification of locally semicomplete digraphs ⋮ Quasi‐transitive digraphs ⋮ Multipartite tournaments: a survey ⋮ Cycle-connected mixed graphs and related problems ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Semicomplete Multipartite Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Chvátal-Erdős condition for (1,1)-factors in digraphs
• On multipartite tournaments
• Highly connected non-2-linked digraphs
• Cycles through \(k\) vertices in bipartite tournaments
• A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
• Paths and cycles in extended and decomposable digraphs
• Cycles and paths in bipartite tournaments with spanning configurations
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Quasi‐transitive digraphs

This page was built for publication: On \(k\)-strong and \(k\)-cyclic digraphs