Abstract
We give a polynomial time algorithm to compute the bandwidth of a ( q, q−4)-graph for each constant q. We show also that the bandwidth and topological bandwidth of P 4-sparse graphs are equal. Let H be a subdivision of a graph G with a minimal number of vertices such that the bandwidth of H equals the topological bandwidth of G. We show that the number of vertices of H is O( n 3), where n is the number of vertices in G, and thus the topological bandwidth of a graph of constant size can be computed in constant time.
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.
