Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
暂无分享,去创建一个
Maria Chudnovsky | Alex Scott | Paul Seymour | Sophie Spirkl | A. Scott | P. Seymour | M. Chudnovsky | S. Spirkl
[1] Alex D. Scott,et al. Induced trees in graphs of large chromatic number , 1997, J. Graph Theory.
[2] Alex Scott,et al. Induced subgraphs of graphs with large chromatic number. XIII. New brooms , 2018, Eur. J. Comb..
[3] Sean McGuinness,et al. Colouring Arcwise Connected Sets in the Plane II , 2000, Graphs Comb..
[4] Paul D. Seymour,et al. Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes , 2015, Journal of combinatorial theory. Series B (Print).
[5] Paul D. Seymour,et al. Induced subgraphs of graphs with large chromatic number. I. Odd holes , 2014, J. Comb. Theory, Ser. B.
[6] Paul D. Seymour,et al. Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures , 2016, J. Comb. Theory, Ser. B.
[7] A. Gyárfás. Problems from the world surrounding perfect graphs , 1987 .
[8] Nicolas Trotignon,et al. On graphs with no induced subdivision of K4 , 2012, J. Comb. Theory, Ser. B.
[9] Maria Chudnovsky,et al. Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings , 2016, J. Comb. Theory, Ser. B.
[10] ChudnovskyMaria,et al. Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás conjectures , 2016 .
[11] William T. Trotter,et al. Triangle-free intersection graphs of line segments with large chromatic number , 2012, J. Comb. Theory, Ser. B.
[12] Paul Seymour,et al. Bounding the vertex cover number of a hypergraph , 1994, Comb..
[13] Alex Scott,et al. Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue , 2017, Combinatorica.
[14] Paul D. Seymour,et al. Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes , 2015, Comb..
[15] Nicolas Bousquet,et al. Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs , 2011, Combinatorics, Probability and Computing.