Abstract
We derive new upper bounds on the bisection width of graphs which have a regular vertex degree. We show that the bisection width of sufficiently large 3-regular graphs with | V | vertices is at most ( 1 6 + ε ) | V | , ε > 0 . For the bisection width of sufficiently large 4-regular graphs we show an upper bound of ( 2 5 + ε ) | V | , ε > 0 .
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.
