Paths and cycles in extended and decomposable digraphs

DOI10.1016/S0012-365X(96)00038-6zbMath0872.05028OpenAlexW2080732695MaRDI QIDQ1356688

Gregory Gutin, Jörgen Bang-Jensen

Publication date: 7 October 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00038-6

zbMATH Keywords

digraphHamiltonian pathslongest path problemlongest cycle problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

On \(k\)-strong and \(k\)-cyclic digraphs ⋮ Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs ⋮ Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs ⋮ The acyclic disconnection of a digraph ⋮ The structure of strong arc-locally in-semicomplete digraphs ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Miscellaneous Digraph Classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of locally semicomplete digraphs
• Vertex heaviest paths and cycles in quasi-transitive digraphs
• Cycles and paths in bipartite tournaments with spanning configurations
• Weakly Hamiltonian-connected ordinary multipartite tournaments
• Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
• Locally semicomplete digraphs: A generalization of tournaments
• Hamilton Cycles in Oriented Graphs
• Connectivity properties of locally semicomplete digraphs
• Finding a Longest Path in a Complete Multipartite Digraph
• Quasi‐transitive digraphs

This page was built for publication: Paths and cycles in extended and decomposable digraphs