Detecting an Odd Hole
暂无分享,去创建一个
Maria Chudnovsky | Alex Scott | Paul Seymour | Sophie Spirkl | A. Scott | P. Seymour | M. Chudnovsky | S. Spirkl
[1] A. Gyárfás. Problems from the world surrounding perfect graphs , 1987 .
[2] Michele Conforti,et al. Testing balancedness and perfection of linear matrices , 1993, Math. Program..
[3] Gérard Cornuéjols,et al. Even‐hole‐free graphs part II: Recognition algorithm , 2002, J. Graph Theory.
[4] Gérard Cornuéjols,et al. Decomposition of Balanced Matrices , 1999, J. Comb. Theory, Ser. B.
[5] Paul D. Seymour,et al. Recognizing Berge Graphs , 2005, Comb..
[6] Da Silva,et al. Even-hole-free graphs , 2008 .
[7] Paul D. Seymour,et al. Detecting an induced net subdivision , 2013, J. Comb. Theory, Ser. B.
[8] Maria Chudnovsky,et al. Detecting a Theta or a Prism , 2008, SIAM J. Discret. Math..
[9] Alex Scott,et al. Induced subgraphs of graphs with large chromatic number. XIII. New brooms , 2018, Eur. J. Comb..
[10] Daniel Bienstock,et al. On the complexity of testing for odd holes and induced odd paths , 1991, Discret. Math..
[11] Paul D. Seymour,et al. Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes , 2015, Comb..
[12] Paul D. Seymour,et al. Induced subgraphs of graphs with large chromatic number. I. Odd holes , 2014, J. Comb. Theory, Ser. B.
[13] Ken-ichi Kawarabayashi,et al. Detecting even holes , 2005, J. Graph Theory.
[14] A. M. Murray. The strong perfect graph theorem , 2019, 100 Years of Math Milestones.
[15] Mikkel Thorup,et al. Three-in-a-tree in near linear time , 2020, STOC.