Bounding the Fractional Chromatic Number of KDelta-Free Graphs
暂无分享,去创建一个
[1] Andrew D. King. Hitting all maximum cliques with a stable set using lopsided independent transversals , 2009, J. Graph Theory.
[2] Daniel Král,et al. The fractional chromatic number of triangle-free subcubic graphs , 2012, Eur. J. Comb..
[3] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .
[4] Robin Thomas,et al. A new proof of the independence ratio of triangle-free cubic graphs , 2001, Discret. Math..
[5] Daniel Král,et al. Fractional total colourings of graphs of high girth , 2009, J. Comb. Theory, Ser. B.
[6] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.
[7] Bruce A. Reed,et al. A Strengthening of Brooks' Theorem , 1999, J. Comb. Theory, Ser. B.
[8] Andrew D. King. Claw-free graphs and two conjectures on omega, delta, and chi , 2009 .
[9] Alexandr V. Kostochka,et al. On an upper bound of a graph's chromatic number, depending on the graph's degree and density , 1977, J. Comb. Theory, Ser. B.
[10] Paul A. Catlin,et al. Hajós' graph-coloring conjecture: Variations and counterexamples , 1979, J. Comb. Theory, Ser. B.
[11] Linyuan Lu,et al. A Fractional Analogue of Brooks' Theorem , 2011, SIAM J. Discret. Math..
[12] Linyuan Lu,et al. The fractional chromatic number of triangle-free graphs with Δ<3 , 2012, Discret. Math..
[13] Ron Aharoni,et al. Independent systems of representatives in weighted graphs , 2007, Comb..
[14] Xuding Zhu,et al. The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three , 2009, SIAM J. Discret. Math..
[15] C. Berge. Fractional Graph Theory , 1978 .