The Grad of a Graph and Classes with Bounded Expansion
暂无分享,去创建一个
[1] Jaroslav Nesetril,et al. Universal H-colorable graphs without a given configuration , 2002, Discrete Mathematics.
[2] Bruce A. Reed,et al. Excluding any graph as a minor allows a low tree-width 2-coloring , 2004, J. Comb. Theory, Ser. B.
[3] Pavol Hell,et al. Universality of A-mote Graphs , 1993, Eur. J. Comb..
[4] Paul D. Seymour,et al. Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.
[5] Jaroslav Nesetril,et al. Tree-depth, subgraph coloring and homomorphism bounds , 2006, Eur. J. Comb..