Abstract
The thickness θ ( G ) of a graph G is the minimum number of planar subgraphs into which G can be decomposed. In this paper, we provide a new upper bound for the thickness of the complete tripartite graphs K n , n , n ( n ≥ 3) and obtain θ ( K n , n , n ) = ⌈( n + 1) / 3⌉ , when n ≡ 3 (mod 6 ).
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.
