Linkages in locally semicomplete digraphs and quasi-transitive digraphs

DOI10.1016/S0012-365X(98)00194-0MaRDI QIDQ1297397zbMATH OpenOpenAlexFDO

Authors Jørgen Bang-Jensen

Publication date 11 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00194-0

zbMATH Keywords

locally semicomplete digraphsquasi-transitive digraphs

Mathematics Subject Classification ID

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

Recommendations

• Disjoint paths in decomposable digraphs
• Improved results on linkage problems
• Quasi-transitive digraphs and their extensions
• scientific article; zbMATH DE number 4085689
• Quasi‐transitive digraphs

Cites work

• scientific article; zbMATH DE number 3172312 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3869359 (Why is no real title available?)
• scientific article; zbMATH DE number 4085689 (Why is no real title available?)
• scientific article; zbMATH DE number 193142 (Why is no real title available?)
• scientific article; zbMATH DE number 403948 (Why is no real title available?)
• scientific article; zbMATH DE number 731861 (Why is no real title available?)
• scientific article; zbMATH DE number 1156581 (Why is no real title available?)
• scientific article; zbMATH DE number 804599 (Why is no real title available?)
• scientific article; zbMATH DE number 867679 (Why is no real title available?)
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• A classification of locally semicomplete digraphs
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
• Edge-disjoint in- and out-branchings in tournaments and related path problems
• Generalizations of tournaments: A survey
• Graph theory
• Kings in quasi-transitive digraphs
• Locally semicomplete digraphs: A generalization of tournaments
• On \(k\)-strong and \(k\)-cyclic digraphs
• On the structure of local tournaments
• On the structure of locally semicomplete digraphs
• Paths and cycles in extended and decomposable digraphs
• Quasi‐transitive digraphs
• Strongly Hamiltonian-connected locally semicomplete digraphs
• The 2-linkage problem for acyclic digraphs
• The directed subgraph homeomorphism problem
• Transitiv orientierbare Graphen
• Vertex heaviest paths and cycles in quasi-transitive digraphs
• Weakly Hamiltonian-connected ordinary multipartite tournaments

Cited in

(9)

• Compositions of digraphs: a survey
• \(k\)-strong spanning local tournaments in locally semicomplete digraphs
• Quasi‐transitive digraphs
• Quasi-transitive digraphs and their extensions
• Chordality of locally semicomplete and weakly quasi-transitive digraphs
• Disjoint paths in decomposable digraphs
• Counterexamples to the linkage conjecture for tournaments
• On the k-linkage problem for generalizations of semicomplete digraphs
• Locally Semicomplete Digraphs and Generalizations

This page was built for publication: Linkages in locally semicomplete digraphs and quasi-transitive digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297397)