Publisher
Springer International Publishing
Reference20 articles.
1. Beisegel, J.: Characterising AT-free graphs with BFS. arXiv preprint (2018)
2. Broersma, H., Kloks, T., Kratsch, D., Müller, H.: Independent sets in asteroidal triple-free graphs. SIAM J. Discret. Math. 12(2), 276–287 (1999)
3. Lecture Notes in Computer Science;JM Chang,2016
4. Chang, J.M., Kloks, T., Wang, H.-L.: Convex geometries on AT-free graphs and an application to generating the AT-free orders. arXiv preprint arXiv:1706.06336 (2017)
5. Chvátal, V.: Antimatroids, betweenness, convexity. In: Cook, W., Lovász, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 57–64. Springer, Berlin (2009). https://doi.org/10.1007/978-3-540-76796-1_3
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Recognition Problem of Graph Search Trees;SIAM Journal on Discrete Mathematics;2021-01
2. Graphs Where Search Methods Are Indistinguishable;Trends in Mathematics;2021
3. Streaming Complexity of Spanning Tree Computation;LEIBNIZ INT PR INFOR;2020
4. Recognizing Graph Search Trees;Electronic Notes in Theoretical Computer Science;2019-08
5. Characterising AT-free Graphs with BFS;Graph-Theoretic Concepts in Computer Science;2018