Abstract
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 shall 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 ).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
