Subject
Discrete Mathematics and Combinatorics
Reference7 articles.
1. Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs;Bollobás;European J. Combin.,1998
2. Deciding first-order properties for sparse graphs;Dvořák,2010
3. Deciding first-order properties of nowhere dense graphs;Grohe,2014
4. Topological cliques in graphs. II;Komlós;Combin. Probab. Comput.,1996
5. Induced subdivisions in Ks,s-free graphs of large average degree;Kühn;Combinatorica,2004
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sparse graphs with bounded induced cycle packing number have logarithmic treewidth;Journal of Combinatorial Theory, Series B;2024-07
2. Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Flip-width: Cops and Robber on dense graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Stable graphs of bounded twin-width;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
5. From χ- to χ-bounded classes;Journal of Combinatorial Theory, Series B;2021-06