%0 Journal Article
%A Gašper Fijavž
%A Seiya Negami
%A Terukazu Sano
%T 3-Connected planar graphs are 5-distinguishing colorable with two exceptions
	
%J Ars Mathematica Contemporanea
%D 2011
%P 165-175
%V 4
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.199.a0e/
%R 10.26493/1855-3974.199.a0e
%G en
%F 10_26493_1855_3974_199_a0e