S. Akbari, H. Bidkhori, and N. Nosrati, r-Strong edge colorings of graphs, Discrete Mathematics, vol.306, issue.23, pp.3005-3010, 2006.
DOI : 10.1016/j.disc.2004.12.027

N. Alon, R. Berke, K. Buchin, M. Buchin, P. Csorba et al., Polychromatic colorings of plane graphs, Proc. of the 24 Annual Symposium on Computational Geometry, pp.338-345, 2008.

P. N. Balister, O. M. Riordan, and R. H. Schelp, Vertex-distinguishing edge colorings of graphs, Journal of Graph Theory, vol.176, issue.2, pp.95-109, 2003.
DOI : 10.1002/jgt.10076

J. A. Bondy, Induced subsets, Journal of Combinatorial Theory, Series B, vol.12, issue.2, pp.201-202, 1972.
DOI : 10.1016/0095-8956(72)90025-1
URL : http://doi.org/10.1016/0095-8956(72)90025-1

A. C. Burris and R. H. Schelp, Vertex-distinguishing proper edge-colorings, Journal of Graph Theory, vol.26, issue.2, pp.73-83, 1997.
DOI : 10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C

M. I. Burstein, An upper bound for the chromatic number of hypergraphs, Sakharth. SSR Mecn. Akad. Moambe, vol.75, pp.37-40, 1974.

J. Cern´ycern´y, M. Hor?ák, and R. Soták, Observability of a graph, Mathematica Slovaca, vol.46, issue.1, pp.21-31, 1996.

I. Charon, G. Cohen, O. Hudry, and A. Lobstein, Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity, Adv. Math. Comm, vol.4, issue.2, pp.403-420, 2008.

B. Courcelle, J. Makowski, and U. Rotics, Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width, Theory of Computing Systems, vol.33, issue.2, pp.125-150, 2000.
DOI : 10.1007/s002249910009

E. Dedó, D. Torri, and N. Z. Salvi, The observability of the Fibonacci and the Lucas cubes, Discrete Mathematics, vol.255, issue.1-3, pp.55-63, 2002.
DOI : 10.1016/S0012-365X(01)00387-9

O. Favaron, H. Li, and R. H. Schelp, Strong edge colorings of graphs, Discrete Mathematics, vol.159, issue.1-3, pp.103-109, 1996.
DOI : 10.1016/0012-365X(95)00102-3

F. Foucaud, I. Honkaka, T. Laihonen, A. Parreau, and G. Perarnau, Locally identifying colourings for graphs with given maximum degree, Discrete Mathematics, vol.312, issue.10, pp.1832-1837, 2012.
DOI : 10.1016/j.disc.2012.01.034
URL : https://hal.archives-ouvertes.fr/hal-00614513

H. Hatami, <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi mathvariant="normal">??</mml:mi><mml:mo>+</mml:mo><mml:mn>300</mml:mn></mml:math> is a bound on the adjacent vertex distinguishing edge chromatic number, Journal of Combinatorial Theory, Series B, vol.95, issue.2, pp.246-256, 2005.
DOI : 10.1016/j.jctb.2005.04.002

M. Hor?ák and R. Soták, Observability of complete multipartite graphs with equipotent parts, Ars Combinatoria, vol.41, pp.289-301, 1995.

M. Hor?ák and R. Soták, Asymptotic behaviour of the observability of Qn, Discrete Mathematics, vol.176, issue.1-3, pp.139-148, 1997.
DOI : 10.1016/S0012-365X(96)00292-0

L. Lovász, Coverings and colorings of hypergraphs Proceedings of the fourth south-eastern conference on combinatorics, graph theory, and computing, Boca Raton, pp.3-12, 1973.

B. M. Moret, Planar NAE3SAT is in P, ACM SIGACT News, vol.19, issue.2, pp.51-54, 1988.
DOI : 10.1145/49097.49099

J. G. Penaud, Une propriété de bicoloration des hypergraphes planaires, Cahiers Centré Etudes Rech. Opér, vol.17, pp.345-349, 1975.

C. Thomassen, The even cycle problem for directed graphs, Journal of the American Mathematical Society, vol.5, issue.2, pp.217-219, 1992.
DOI : 10.1090/S0894-0347-1992-1135027-1

B. Toft, On Colour-critical Hypergraphs, Colloq. Math. Soc., Janos Bolyai, vol.10, pp.1445-1457, 1975.

Z. Zhang, L. Liu, and J. Wang, Adjacent strong edge coloring of graphs, Applied Mathematics Letters, vol.15, issue.5, pp.623-626, 2002.
DOI : 10.1016/S0893-9659(02)80015-5