Abstract
A graph G is uniquely k-colorable if the chromatic number of G is k and G has only one k-coloring up to the permutation of the colors. For a plane graph G, two faces f 1 and f 2 of G are adjacent ( i , j )-faces if d ( f 1 ) = i, d ( f 2 ) = j, and f 1 and f 2 have a common edge, where d ( f ) is the degree of a face f. In this paper, we prove that every uniquely three-colorable plane graph has adjacent ( 3 , k )-faces, where k ≤ 5. The bound of five for k is the best possible. Furthermore, we prove that there exists a class of uniquely three-colorable plane graphs having neither adjacent ( 3 , i )-faces nor adjacent ( 3 , j )-faces, where i , j are fixed in { 3 , 4 , 5 } and i ≠ j. One of our constructions implies that there exists an infinite family of edge-critical uniquely three-colorable plane graphs with n vertices and 7 3 n - 14 3 edges, where n ( ≥ 11 ) is odd and n ≡ 2 ( mod 3 ).
Highlights
Graph coloring is one of the most studied problems in graph theory, because it has many important applications [1,2,3]
By using constructions, we prove that there exist uniquely three-colorable plane graphs having neither adjacent (3, i )-faces nor adjacent (3, j)-faces, where i, j are fixed in {3, 4, 5} and i 6= j
We obtained a structural property of uniquely three-colorable plane graphs
Summary
Graph coloring is one of the most studied problems in graph theory, because it has many important applications [1,2,3]. In 2013, Matsumoto [17] proved that an edge-critical uniquely three-colorable planar graph has at most 83 n − 17 edges and constructed an infinite family of edge-critical uniquely three-colorable planar graphs with n vertices and 94 n − 6 edges, where n ≡ 0 (mod 4). This upper bound was improved by Li et al [13] to n − 6 when n ≥ 6. The results can be used in optimal territorial distribution of mobile operators’ transmitters
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.