暂无分享,去创建一个
[1] Michal Pilipczuk,et al. Polynomial bounds for centered colorings on proper minor-closed graph classes , 2018, SODA.
[2] Zdenek Dvorak,et al. Strongly Sublinear Separators and Polynomial Expansion , 2015, SIAM J. Discret. Math..
[3] J. Nesetril,et al. Grad and classes with bounded expansion III. restricted dualities , 2005, math/0508325.
[4] Jaroslav Nesetril,et al. Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.
[5] Stefan Felsner,et al. Improved bounds for centered colorings , 2019, SODA.
[6] Bruce A. Reed,et al. Acyclic Coloring of Graphs , 1991, Random Struct. Algorithms.
[7] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[8] Kent Quanrud,et al. Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs , 2015, ESA.
[9] Bruce A. Reed,et al. Star coloring of graphs , 2004, J. Graph Theory.
[10] Jaroslav Nesetril,et al. Grad and classes with bounded expansion I. Decompositions , 2008, Eur. J. Comb..
[11] A. Frieze,et al. Introduction to Random Graphs , 2016 .
[12] Blair D. Sullivan,et al. An Experimental Evaluation of a Bounded Expansion Algorithmic Pipeline , 2017 .
[13] Stephan Kreutzer,et al. Coloring and Covering Nowhere Dense Graphs , 2018, SIAM J. Discret. Math..
[14] Blair D. Sullivan,et al. Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion , 2017, ArXiv.