On Fractional Fragility Rates of Graph Classes
暂无分享,去创建一个
[1] D. Wood,et al. Defective and Clustered Graph Colouring , 2018, 1803.07694.
[2] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[3] B. A. Reed,et al. Algorithmic Aspects of Tree Width , 2003 .
[4] Zdenek Dvorak,et al. Sublinear separators, fragility and subexponential expansion , 2014, Eur. J. Comb..
[5] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.
[6] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .
[7] C. Berge. Fractional Graph Theory , 1978 .
[8] Pat Morin,et al. Planar Graphs have Bounded Queue-Number , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[9] David Eppstein,et al. The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.
[10] Vangelis Th. Paschos,et al. Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness , 2005, Theor. Comput. Sci..
[11] Bruce A. Reed,et al. Excluding any graph as a minor allows a low tree-width 2-coloring , 2004, J. Comb. Theory, Ser. B.
[12] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[13] Gwenaël Joret,et al. Colouring Planar Graphs With Three Colours and No Large Monochromatic Components , 2013, Combinatorics, Probability and Computing.
[14] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[15] Michal Pilipczuk,et al. Polynomial bounds for centered colorings on proper minor-closed graph classes , 2018, SODA.
[16] Paul D. Seymour,et al. Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.
[17] David Eppstein. Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.
[18] Jaroslav Nesetril,et al. Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.