A classification of locally semicomplete digraphs
Authors:
- Jørgen Bang-JensenJBJørgen Bang-Jensen
- Yubao GuoYGYubao Guo
- Gregory GutinGGGregory Gutin
- Lutz VolkmannLVLutz Volkmann
- 1 April 1997
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 167-168, 101-114
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On k-strong and k-cyclic digraphsDiscrete Mathematics, 1996
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc GraphsSIAM Journal on Discrete Mathematics, 1996
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphsJournal of Graph Theory, 1995
- On the Structure of Local TournamentsJournal of Combinatorial Theory, Series B, 1995
- On complementary cycles in locally semicomplete digraphsDiscrete Mathematics, 1994
- Connectivity properties of locally semicomplete digraphsJournal of Graph Theory, 1994
- On the structure of locally semicomplete digraphsDiscrete Mathematics, 1992
- Locally semicomplete digraphs: A generalization of tournamentsJournal of Graph Theory, 1990
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular‐arc graphs, and nested interval graphsJournal of Graph Theory, 1982
- A Note on the Number of 4-Circuits in a Tournament1982