Subject
Discrete Mathematics and Combinatorics
Reference19 articles.
1. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. ACM (JACM),1994
2. Domination, packing and excluded minors;Böhme;Electron. J. Combin.,2003
3. Graphs with linearly bounded Ramsey numbers;Chen;J. Combin. Theory Ser. B,1993
4. Z. Dvořák, Asymptotical structure of combinatorial objects, Ph.D. Thesis, Charles University in Prague, 2007.
5. On forbidden subdivision characterizations of graph classes;Dvořák;European J. Combin.,2008
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Discrepancy and sparsity;Journal of Combinatorial Theory, Series B;2024-11
2. Shallow Minors, Graph Products, and Beyond-Planar Graphs;SIAM Journal on Discrete Mathematics;2024-03-13
3. Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs;Journal of Function Spaces;2024-02-29
4. Flip-width: Cops and Robber on dense graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models;The Electronic Journal of Combinatorics;2023-09-22