Some results on the injective chromatic number of graphs
暂无分享,去创建一个
[1] D. Gonçalves,et al. On the L(p, 1)-labelling of graphs , 2008, Discret. Math..
[2] R. Duffin. Topology of series-parallel networks , 1965 .
[3] André Raspaud,et al. Some bounds on the injective chromatic number of graphs , 2010, Discret. Math..
[4] Gerard J. Chang,et al. The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..
[5] Jan Kratochvíl,et al. On the injective chromatic number of graphs , 2002, Discret. Math..
[6] Seog-Jin Kim,et al. Injective chromatic number and chromatic number of the square of graphs , 2009 .
[7] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[8] André Raspaud,et al. Injective coloring of planar graphs , 2009, Discret. Appl. Math..
[9] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[10] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[11] Xuding Zhu,et al. Coloring the square of a K4-minor free graph , 2003, Discret. Math..
[12] Daniel Král,et al. A Theorem about the Channel Assignment Problem , 2003, SIAM J. Discret. Math..