L. D. Andersen, The strong chromatic index of a cubic graph is at most 10, Discrete Mathematics, vol.108, issue.1-3, pp.231-252, 1992.
DOI : 10.1016/0012-365X(92)90678-9

J. Balogh, A. Kostochka, and X. Liu, Packing chromatic number of cubic graphs, Discrete Mathematics, vol.341, issue.2, pp.474-483, 2018.
DOI : 10.1016/j.disc.2017.09.014

B. Bre?ar, S. Klav?ar, and D. F. , Packing chromatic number of base-3 sierpi?ski graphs, Graphs and Combinatorics, pp.1313-1327, 2016.

B. Bre?ar, S. Klav?ar, D. F. Rall, and K. Wash, Packing chromatic number under local changes in a graph, Discrete Mathematics, vol.340, issue.5, pp.1110-1115, 2017.
DOI : 10.1016/j.disc.2016.09.030

G. Brinkmann, J. Goedgebeur, J. Hägglund, and K. Markström, Generation and properties of snarks, Journal of Combinatorial Theory, Series B, vol.103, issue.4, pp.468-488, 2013.
DOI : 10.1016/j.jctb.2013.05.001
URL : https://doi.org/10.1016/j.jctb.2013.05.001

R. Cowen, R. H. Cowen, and D. R. Woodall, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, Journal of Graph Theory, vol.1, issue.2, pp.187-195, 1986.
DOI : 10.1002/jgt.3190100207

J. Fiala and P. A. Golovach, Complexity of the packing coloring problem for trees, Discrete Applied Mathematics, vol.158, issue.7, pp.771-778, 2010.
DOI : 10.1016/j.dam.2008.09.001

A. S. Finbow and D. F. , On the packing chromatic number of some lattices, Discrete Applied Mathematics, vol.158, issue.12, pp.1224-1228, 2010.
DOI : 10.1016/j.dam.2009.06.001

J. L. Fouquet and J. L. Jolivet, Strong edge-colorings of graphs and applications to multik-gons , Ars Combinatoria, pp.141-150, 1983.

J. L. Fouquet and J. L. Jolivet, Tools for parsimonious edge-coloring of graphs with maximum degree three, 2012.

J. L. Fouquet and J. M. Vanherpe, On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three, Graphs and Combinatorics, vol.3, issue.12, pp.475-487, 2013.
DOI : 10.1016/j.disc.2003.05.005
URL : https://hal.archives-ouvertes.fr/hal-01367903

N. Gastineau and O. Togni, <mml:math altimg="si24.gif" display="inline" 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" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>S</mml:mi></mml:math>-packing colorings of cubic graphs, Discrete Mathematics, vol.339, issue.10, pp.2461-2470, 2016.
DOI : 10.1016/j.disc.2016.04.017

N. Gastineau, H. Kheddouci, and O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, Ars Mathematica Contemporanea, vol.9, pp.331-354, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01157901

N. Gastineau, P. Holub, and O. Togni, On the packing chromatic number of subcubic outerplanar graphs, p.2017

W. Goddard, Acyclic colorings of planar graphs, Discrete Mathematics, vol.91, issue.1, pp.91-94, 1991.
DOI : 10.1016/0012-365X(91)90166-Y
URL : https://doi.org/10.1016/0012-365x(91)90166-y

W. Goddard and H. Xu, The S-packing chromatic number of a graph, Discussiones Mathematicae Graph Theory, vol.32, issue.4, pp.795-806, 2012.
DOI : 10.7151/dmgt.1642

W. Goddard and H. Xu, A note on <mml:math altimg="si27.gif" display="inline" 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" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>S</mml:mi></mml:math>-packing colorings of lattices, Discrete Applied Mathematics, vol.166, pp.255-262, 2014.
DOI : 10.1016/j.dam.2013.09.016

W. Goddard, S. M. Hedetniemi, S. T. Hedetniemi, J. M. Harris, and D. F. , Broadcast chromatic numbers of graphs, Ars Combinatoria, vol.86, pp.33-49, 2008.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov, On strong edge-colouring of subcubic graphs, Discrete Applied Mathematics, vol.161, issue.16-17, pp.2467-2479, 2013.
DOI : 10.1016/j.dam.2013.05.021
URL : https://hal.archives-ouvertes.fr/hal-00686021

R. Luko?ka, E. Má?ajová, J. Mazák, and M. ?koviera, Small snarks with large oddness, The Electronic Journal of Combinatorics, vol.22, issue.1, pp.1-51, 2015.

C. Payan, Sur quelques problèmes de couvertures et de couplages en combinatoire, Thèse d'état, 1977.

K. S. Poh, On the linear vertex-arboricity of a planar graph, Journal of Graph Theory, vol.10, issue.1, pp.73-75, 1990.
DOI : 10.1002/jgt.3190140108

P. G. Tait, Remarks on the colourings of maps, Proc. R. Soc. Edinburgh, p.729, 1880.