Obstructions for acyclic local tournament orientation completions
From MaRDI portal
Publication:2099464
DOI10.1016/j.disc.2022.113220zbMath1504.05107arXiv2008.07104OpenAlexW4307725203MaRDI QIDQ2099464
Publication date: 23 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.07104
obstructionproper interval graphproper circular-arc graphacyclic local tournamentorientation completion
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the structure of local tournaments
- Obstructions for acyclic local tournament orientation completions
- Locally semicomplete digraphs: A generalization of tournaments
- A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- Completing orientations of partially oriented graphs
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
- Nombre chromatique et plus longs chemins d'un graphe
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
