Author:
Dallard Clément,Ganian Robert,Hatzel Meike,Krnc Matjaž,Milanič Martin
Funder
European Research Council
Austrian Science Fund
Reference39 articles.
1. Adhikary, R., Bose, K., Mukherjee, S., Roy, B., 2020. Complexity of maximum cut on interval graphs. arXiv preprint arXiv:2006.00061.
2. On asteroidal sets in chordal graphs;Alcón;Discrete Appl. Math.,2014
3. Beisegel, J., Chudnovsky, M., Gurvich, V., Milanič, M., Servatius, M., 2019. Avoidable vertices and edges in graphs, in: Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer, pp. 126–139.
4. Graph extremities defined by search algorithms;Berry;Algorithms (Basel),2010
5. Separability generalizes Dirac’s theorem;Berry;Discrete Appl. Math.,1998
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graphs with at most two moplexes;Journal of Graph Theory;2024-05-08