Funder
National Science Foundation
National Research Foundation of Korea
Korea government
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. Partitioning into graphs with only small components;Alon;J. Combin. Theory Ser. B,2003
2. Decomposition, approximation, and coloring of odd-minor-free graphs;Demaine,2010
3. Excluding any graph as a minor allows a low tree-width 2-coloring;DeVos;J. Combin. Theory Ser. B,2004
4. Excluding a countable clique;Diestel;J. Combin. Theory Ser. B,1999
5. Some results on tree decomposition of graphs;Ding;J. Graph Theory,1995
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Defective Coloring is Perfect for Minors;Combinatorica;2024-02-21
2. Tree-Partitions with Bounded Degree Trees;MATRIX Book Series;2024
3. Proof of the Clustered Hadwiger Conjecture;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Colouring strong products;European Journal of Combinatorics;2023-09
5. Asymptotic dimension of minor-closed families and Assouad–Nagata dimension of surfaces;Journal of the European Mathematical Society;2023-05-08