Abstract
We investigate the clique number, the chromatic number and the inductiveness (or the degeneracy) of the square G2 of an outerplanar graph G, and bound as a function of the maximum degree Δ of G. Our main result is a tight bound of Δ for the inductiveness of the square of any outerplanar graph G, when Δ ≥ τ. This implies that a greedy algorithm yields an optimal coloring of such square graphs, and leads to an exact linear time algorithm that holds for any Δ. We then derive optimal upper bounds on the three parameters for outerplanar graphs of smaller degree Δ
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.
