scientific article; zbMATH DE number 731861
From MaRDI portal
Publication:4325297
zbMath0817.05061MaRDI QIDQ4325297
Publication date: 8 March 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (16)
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 ⋮ Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments ⋮ Extended path partition conjecture for semicomplete and acyclic compositions ⋮ Semicomplete compositions of digraphs ⋮ Packing strong subgraph in digraphs ⋮ Minimum cycle factors in quasi-transitive digraphs ⋮ Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs ⋮ Longest path partitions in generalizations of tournaments ⋮ Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs ⋮ Weakly Hamiltonian-connected ordinary multipartite tournaments ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Kings in quasi-transitive digraphs ⋮ Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
This page was built for publication:
