暂无分享,去创建一个
[1] Bruce A. Reed,et al. Asymptotics of the Chromatic Number for Quasi-Line Graphs , 2013, J. Graph Theory.
[2] B. M. Fulk. MATH , 1992 .
[3] Thomas Niessen,et al. The round-up property of the fractional chromatic number for proper circular arc graphs , 2000, J. Graph Theory.
[4] Jeff Kahn,et al. Asymptotics of the Chromatic Index for Multigraphs , 1996, J. Comb. Theory, Ser. B.
[5] Xiaotie Deng,et al. Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs , 1996, SIAM J. Comput..
[6] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[7] Paul D. Seymour,et al. A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs , 2013, SIAM J. Discret. Math..
[8] Katherine Edwards,et al. Bounding the fractional chromatic number of KΔ-free graphs , 2012, arXiv.org.
[9] Bruce A. Reed,et al. An upper bound for the chromatic number of line graphs , 2007, Eur. J. Comb..
[10] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .
[11] T. Karthick,et al. Bounding χ in terms of ω and Δ for some classes of graphs , 2011, Discret. Math..
[12] Paul D. Seymour,et al. The structure of claw-free graphs , 2005, BCC.