Cycles passing through k + 1 vertices in k-connected graphs
暂无分享,去创建一个
[1] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[2] Manouchehr Zaker. Inequalities for the Grundy chromatic number of graphs , 2007, Discret. Appl. Math..
[3] Manouchehr Zaker,et al. Grundy chromatic number of the complement of bipartite graphs , 2005, Australas. J Comb..
[4] Paul Erdős. Some recent problems and results in graph theory , 1997 .
[5] János Komlós,et al. A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.
[6] Fan Chung,et al. Open problems of Paul Erdos in graph theory , 1997 .
[7] Jeong Han Kim,et al. The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.
[8] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .
[9] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[10] Ladislav Stacho. New upper bounds for the chromatic number of a graph , 2001 .
[11] Béla Bollobás,et al. Books in graphs , 2005, Eur. J. Comb..
[12] Joel H. Spencer,et al. Asymptotic lower bounds for Ramsey functions , 1977, Discret. Math..
[13] L. Lovász. Combinatorial problems and exercises , 1979 .
[14] Manouchehr Zaker,et al. Results on the Grundy chromatic number of graphs , 2006, Discret. Math..
[15] Paul Erdös,et al. Chromatic number of finite and infinite graphs and hypergraphs , 1985, Discret. Math..