Author:
Montassier Mickaël,Pêcher Arnaud,Raspaud André
Reference11 articles.
1. N. Biggs, Some odd graph theory, Annals New York Academy of Sciences (1979), 71–81.
2. O. V. Borodin and A. O. Ivanova, Precise upper bound for the strong edge chromatic number of sparse planar graphs, Discussiones Mathematicae Graph Theory, 2013, to appear.
3. G. Chang, M. Montassier, A. Pêcher and A. Raspaud, Strong chromatic index of planar graphs with large girth, submitted.
4. P. Erdős, Problems and results in combinatorial analysis and graph theory, Discrete Math. 72 (1988), 81–92.
5. P. Erdős and J. Nešetřil, Problem, In: “Irregularities of Partitions”, G. Halász and V. T. Sós (eds.), Springer, Berlin, 1989, 162–163.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献