Publication:4325297
From MaRDI portal
zbMath0817.05061MaRDI QIDQ4325297
Publication date: 8 March 1995
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
Related Items
Semicomplete compositions of digraphs, Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments, Minimum cycle factors in quasi-transitive digraphs, Linkages in locally semicomplete digraphs and quasi-transitive digraphs, A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, Vertex heaviest paths and cycles in quasi-transitive digraphs, Paths and cycles in extended and decomposable digraphs, Kings in quasi-transitive digraphs, Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs, Weakly Hamiltonian-connected ordinary multipartite tournaments, Extended path partition conjecture for semicomplete and acyclic compositions, Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs, Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs, Longest path partitions in generalizations of tournaments, Packing strong subgraph in digraphs, Quasi-Transitive Digraphs and Their Extensions