Author:
Kühn Daniela,Osthus Deryk,Treglown Andrew
Funder
Engineering and Physical Sciences Research Council
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference27 articles.
1. Properly colored Hamilton cycles in edge colored complete graphs;Alon;Random Structures Algorithms,1997
2. Testing subgraphs in directed graphs;Alon;J. Comput. System Sci.,2004
3. The Probabilistic Method;Alon,2000
4. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2000
5. Cycles in digraphs – a survey;Bermond;J. Graph Theory,1981
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hamilton cycles in dense regular digraphs and oriented graphs;Journal of Combinatorial Theory, Series B;2024-01
2. On sufficient conditions for spanning structures in dense graphs;Proceedings of the London Mathematical Society;2023-07-21
3. Path decompositions of tournaments;Proceedings of the London Mathematical Society;2023-01-19
4. Cycle Partition of Dense Regular Digraphs and Oriented Graphs;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
5. Tiling Dense Hypergraphs;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023