Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. On bridged graphs and cop-win graphs;Anstee;J. Combin. Theory Ser. B,1988
2. Complexes of graph homomorphisms;Babson;Israel J. Math.,2006
3. Fixed points in partially ordered sets;Baclawski;Adv. Math.,1979
4. J.A. Barmak, E.G. Minian, Strong homotopy types, nerves and collapses, July 2009. arXiv:math.AT/0907.2954v1.
5. Graphes et ordonnés démontables, propriété de la clique fixe;Bélanger;Discrete Math.,1994
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fundamental groupoids for graphs;CATEG GEN ALGEBRAIC;2022
2. Strong collapse and persistent homology;Journal of Topology and Analysis;2021-04-12
3. Strong collapse and persistent homology;Journal of Topology and Analysis;2021-04-12
4. A hierarchy of dismantlings in graphs;Discrete Mathematics;2020-08
5. A homotopy category for graphs;Journal of Algebraic Combinatorics;2020-06-13