On forbidden induced subgraphs for K1, 3-free perfect graphs
暂无分享,去创建一个
Premysl Holub | Zdenek Ryjácek | Petr Vrána | Ingo Schiermeyer | Christoph Brause | Adam Kabela | Z. Ryjáček | I. Schiermeyer | Christoph Brause | Přemysl Holub | P. Vrána | A. Kabela
[1] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .
[2] P. Seymour,et al. The Strong Perfect Graph Theorem , 2002, math/0212070.
[3] Paul D. Seymour,et al. Claw-free graphs VI. Colouring , 2010, J. Comb. Theory, Ser. B.
[4] Ingo Schiermeyer,et al. On the chromatic number of 2K2-free graphs , 2019, Discret. Appl. Math..
[5] Stephan Olariu,et al. Paw-Fee Graphs , 1988, Inf. Process. Lett..
[6] A. Gyárfás. Problems from the world surrounding perfect graphs , 1987 .
[7] J. A. Bondy,et al. Graph Theory , 2008, Graduate Texts in Mathematics.
[8] P. Erdös,et al. Graph Theory and Probability , 1959 .
[9] Jeong Han Kim,et al. The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.
[10] Vasek Chvátal,et al. Recognizing claw-free perfect graphs , 1987, J. Comb. Theory, Ser. B.
[11] Ingo Schiermeyer,et al. The Ramsey number r(C7, C7, C7) , 2003, Discuss. Math. Graph Theory.