Square-Free Graphs with no Induced Fork
暂无分享,去创建一个
Shenwei Huang | T. Karthick | Jenny Kaufmann | M. Chudnovsky | M. Chudnovsky | Jenny Kaufmann | Shenwei Huang | T. Karthick
[1] Paul D. Seymour,et al. The structure of claw-free graphs , 2005, BCC.
[2] Ingo Schiermeyer,et al. On the chromatic number of 2K2-free graphs , 2019, Discret. Appl. Math..
[3] Maria Chudnovsky,et al. Coloring quasi‐line graphs , 2007, J. Graph Theory.
[4] A. Gyárfás. Problems from the world surrounding perfect graphs , 1987 .
[5] Ingo Schiermeyer,et al. Vertex Colouring and Forbidden Subgraphs – A Survey , 2004, Graphs Comb..
[6] Paul D. Seymour,et al. Claw-free graphs VI. Colouring , 2010, J. Comb. Theory, Ser. B.
[7] Hal A. Kierstead,et al. Radius two trees specify χ-bounded classes , 1994, J. Graph Theory.
[8] Jan Mycielski. Sur le coloriage des graphs , 1955 .
[9] Jeong Han Kim,et al. The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.
[10] Maria Chudnovsky,et al. Excluding the fork and antifork , 2020, Discret. Math..