Locally Semicomplete Digraphs and Generalizations-Reference-Cited by-同舟云学术

Locally Semicomplete Digraphs and Generalizations

Published:2018 Issue: Volume: Page:245-296
ISSN:1439-7382
Container-title:Springer Monographs in Mathematics
language:
Short-container-title:

Author:

Bang-Jensen Jørgen

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-71840-8_6

Reference73 articles.

1. N. Alon, D. Lokshtanov, and S. Saurabh. Fast FAST. In ICALP 2009: 36th International Colloquium on Automata, Languages and Programming, Part I, volume 5555 of Lect. Notes Comput. Sci., pages 49–58, 2009.

2. B. Alspach and C. Tabib. A note on the number of $$4$$-circuits in a tournament. In Theory and practice of combinatorics, volume 60 of North-Holland Math. Stud., pages 13–19. North-Holland, Amsterdam, 1982.

3. J. Bang-Jensen. A reformulation of Huang’s structure theorem for local tournaments with some consequences. Technical report 13, Department of Mathematics and Computer Science, Odense University, Denmark, 1994.

4. J. Bang-Jensen. Digraphs with the path-merging property. J. Graph Theory, 20(2):255–265, 1995.

5. J. Bang-Jensen. Disjoint paths with prescribed ends and cycles through given arcs in locally semicomplete digraphs and quasi-transitive digraphs. Technical Report 22, Department of Mathematics and Computer Science, Odense University, Denmark, 1996.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On coloring digraphs with forbidden induced subgraphs;Journal of Graph Theory;2022-12-21

2. On the complexity of singly connected vertex deletion;Theoretical Computer Science;2022-10

3. On the Complexity of Singly Connected Vertex Deletion;Lecture Notes in Computer Science;2020

4. Graph Model Approach to Hierarchy Control Network;Cyber-Physical Systems and Control;2019-11-30

5. Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs;SOFSEM 2019: Theory and Practice of Computer Science;2019