Author:
Nešetřil Jaroslav,Ossona de Mendez Patrice
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. Exluding any graph as a minor allows a low tree-width 2-coloring;DeVos;Journal of Combinatorial Theory, Series B,2004
2. Universal H-colourable graphs without a given configuration;Dreyer;Discrete Math.,2002
3. Universality of A–mote graphs;Häggkvist;European Journal of Combinatorics,1993
4. Tree depth, subgraph coloring and homomorphism bounds;Nešetřil;European Journal of Combinatorics,2004
5. Graph Minors. XVI. Excluding a non-planar graph;Robertson;Journal of Combinatorial Theory, Series B,2003
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献