Please send your open problems and comments to Sophie Spirkl to be included here.
Click here to download a PDF version.
The webpage of the workshop can be found here.
|(a) χf(G) ≤ had(G)||(b) χ(G) ≤ hadf(G)||(c) χf(G) ≤ hadf(G)|
|(i)||Σ(q(s) : s ∈ S(G) and v ∈ s) = 1 for each vertex v, and|
|(ii)||Σ(q(s) : s ∈ S(G)) ≤ k.|
|||L. Babel, S. Olariu, On the structure of graphs with few P4's, Discrete Applied Mathematics 84 (1998) 1-13.|
|||E. Berger, K. Choromanski, M. Chudnovsky, J. Fox, M. Loebl, A. Scott, P. Seymour, and S. Thomassé, Tournaments and colouring, Journal of Combinatorial Theory Series B 103 (2013), 1-20.|
|||S. Bessy, D. Rautenbach, Bounds, Approximation, and Hardness for the Burning Number, arXiv:1511.06023.|
|||A. Bonato, J. Janssen, E. Roshanbin, How to burn a graph, arXiv:1507.06524.|
|||R. Brewster, S. McGuinness, B. Moore, J. A. Noel, A Dichotomy Theorem for Circular Colouring Reconfiguration, arXiv:1508.05573v1.|
|||I. Choi, O. J. Kwon, S. I. Oum, Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors, arXiv:1512.03481.|
|||Z. Dvořák, D. Král', Classes of graphs with small rank decompositions are χ-bounded, European Journal of Combinatorics 33.4 (2012): 679-683.|
|||P. Erdős, J. Spencer, Lopsided Lovász local lemma and Latin transversals, Discrete Appl. Math., 30 (1991), pp. 151-154.|
|||J. Fox, Constructing dense graphs with sublinear Hadwiger number. arXiv:1108.4953, to appear in J. Combin. Theory Ser. B.|
|||D. J. Harvey, D. R. Wood, Parameters tied to treewidth, arXiv:1312.3401, to appear in J. Graph Theory.|
|||P. Heggernes, D. Lokshtanov, Optimal broadcast domination in polynomial time. Discrete Mathematics 36 (2006) 3267-3280.|
|||N. Morrison, J. A. Noel, A. Scott, Saturation in the Hypercube and Bootstrap Percolation, arXiv:1408.5488v1, to appear in Combin. Probab. Comput.|
|||A. S. Pedersen, Contributions to the Theory of Colourings, Graph Minors, and Independent Sets, PhD thesis, Department of Mathematics and Computer Science University of Southern Denmark, 2011.|
|||B. A. Reed, P. D. Seymour, Fractional colouring and Hadwiger's conjecture, J. Combin. Theory Ser. B, 74(2), 147-152, 1998.|
|||P. D. Seymour, R. Thomas, Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B, 58:22-33, 1993.|
|||L.E. Teshima, Multipackings of Graphs, arXiv:1409.8057v1.|