Voir la notice de l'article provenant de la source Library of Science
@article{DMGT_2012_32_1_a14, author = {Gregor, Petr and \v{S}krekovski, Riste}, title = {Parity vertex colorings of binomial trees}, journal = {Discussiones Mathematicae. Graph Theory}, pages = {177--180}, publisher = {mathdoc}, volume = {32}, number = {1}, year = {2012}, language = {en}, url = {http://geodesic.mathdoc.fr/item/DMGT_2012_32_1_a14/} }
Gregor, Petr; Škrekovski, Riste. Parity vertex colorings of binomial trees. Discussiones Mathematicae. Graph Theory, Tome 32 (2012) no. 1, pp. 177-180. http://geodesic.mathdoc.fr/item/DMGT_2012_32_1_a14/
[1] P. Borowiecki, K. Budajová, S. Jendrol' and S. Krajči, Parity vertex colouring of graphs, Discuss. Math. Graph Theory 31 (2011) 183-195, doi: 10.7151/dmgt.1537.
[2] D.P. Bunde, K. Milans, D.B. West and H. Wu, Parity and strong parity edge-colorings of graphs, Combinatorica 28 (2008) 625-632, doi: 10.1007/s00493-008-2364-3.
[3] A.A. Dobrynin, R. Entringer and I. Gutman, Wiener index of trees: theory and applications, Acta Appl. Math. 66 (2001) 211-249, doi: 10.1023/A:1010767517079.