On the structure of locally semicomplete digraphs
type: Item
instance of: scholarly article
title: On the structure of locally semicomplete digraphs
zbMATH Open document ID: 0759.05040
DOI: 10.1016/0012-365X(92)90645-V
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 90262
zbMATH Keywords: locally semicomplete digraphs
zbMATH Keywords: tournaments
zbMATH Keywords: circular-arc graphs
author: Jørgen Bang-Jensen
MaRDI profile type: Publication
cites work: Q3815328
cites work: Locally semicomplete digraphs: A generalization of tournaments
cites work: Q4201932
cites work: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
cites work: Q3872493
cites work: Q5422499
cites work: The directed subgraph homeomorphism problem
cites work: Q5576243
cites work: Q4756732
cites work: Q3691764
cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
cites work: Hamiltonian-connected tournaments
cites work: Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
cites work: Q3337490
cites work: Q3691763
cites work: Highly connected non-2-linked digraphs
cites work: Cycles of each length in tournaments
cites work: Matrix characterizations of circular-arc graphs
Wikidata QID: Q127871738
full work available at URL: 0012-365x(92)90645-v
OpenAlex ID: W1972488642
description: scientific article; zbMATH DE number 90262