A graph ?$G$? is said to be? $d$?-distinguishing colorable if there is a ?$d$?-coloring of ?$G$? such that no automorphism of ?$G$? except the identity map preserves colors. We prove that every 3-connected planar graph is 5-distinguishing colorable except ?$K_{2,2,2}$? and ?$C_6 + \overline{K}_2$? and that every 3-connected bipartite planar graph is 3-distinguishing colorable except ?$Q_3$? and ?$R(Q_3)$?.

Rights

URN

URN:NBN:SI:DOC-FA41EGJV

COBISSID

16089689

Added

16.12.2021

Metadata

Citation

APA:

Fijavž, Gašper, Negami, Seiya, Terukazu, Sano (2011). 3-Connected planar graphs are 5-distinguishing colorable with two exceptions. Ars mathematica contemporanea, volume 4, issue 1, str. 165-175. URN:NBN:SI:DOC-FA41EGJV from http://www.dlib.si

MLA:

Fijavž, Gašper, Negami, Seiya, Terukazu, Sano. "3-Connected planar graphs are 5-distinguishing colorable with two exceptions." Ars mathematica contemporanea volume 4. issue 1 (2011) str. 165-175.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-FA41EGJV>

Ars mathematica contemporanea
2008-
(Assembly record)