Skip to main content
Conference Proceedings

Upper bounds on the bisection width of 3-and 4-regular graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2136 524-536
DOI: 10.1007/3-540-44683-4_46
21Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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 large 3-regular graphs with |V| vertices is at most (Formula presented) |V|. For the bisection width of large 4-regular graphs we show an upper bound of (Formula presented) |V|.

Author supplied keywords

Cite

CITATION STYLE

APA

Monien, B., & Preis, R. (2001). Upper bounds on the bisection width of 3-and 4-regular graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2136, pp. 524–536). Springer Verlag. https://doi.org/10.1007/3-540-44683-4_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free