Author:
Kühn Daniela,Osthus Deryk,Taraz Anusch
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. The algorithmic aspects of the regularity lemma;Alon;J. Algorithms,1994
2. Minimal regular graphs of girths eight and twelve;Benson;Canad. J. Math.,1966
3. Extremal Graph Theory;Bollobás,1978
4. Spanning maximal subgraphs of random graphs;Bollobás;Random Struct. Algorithms,1991
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Many Hamiltonian subsets in large graphs with given density;Combinatorics, Probability and Computing;2023-10-02
2. On sufficient conditions for spanning structures in dense graphs;Proceedings of the London Mathematical Society;2023-07-21
3. On Perfect Subdivision Tilings;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
4. Minimum Degrees for Powers of Paths and Cycles;SIAM Journal on Discrete Mathematics;2022-11-14
5. Spanning surfaces in 3-graphs;Journal of the European Mathematical Society;2021-08-24