Linkages in locally semicomplete digraphs and quasi-transitive digraphs

DOI10.1016/S0012-365X(98)00194-0zbMATH Open0929.05036OpenAlexW2018551116MaRDI QIDQ1297397FDOQ1297397

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

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

zbMATH Keywords

locally semicomplete digraphsquasi-transitive digraphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• \(k\)-strong spanning local tournaments in locally semicomplete digraphs
• Quasi‐transitive digraphs
• Disjoint Paths in Decomposable Digraphs
• Quasi-Transitive Digraphs and Their Extensions
• 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)