Open Access
On a lower bound for the isoperimetric number of cubic graphs
Alexandr V. Kostochka,Leonid S. Mel'nikov +1 more
- 01 Jan 1993
- pp 251-265
31
About: The article was published on 01 Jan 1993. and is currently open access. The article focuses on the topics: Upper and lower bounds & Cubic graph.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Upper bounds on the bisection width of 3- and 4-regular graphs
Burkhard Monien,Robert Preis +1 more
TL;DR: New upper bounds on the bisection width of graphs which have a regular vertex degree are derived and are shown to be at most ( 1 6 + e) | V | , e > 0.
63
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
Burkhard Monien,Robert Preis +1 more
- 27 Aug 2001
TL;DR: New upper bounds on the bisection width of graphs which have a regular vertex degree are derived and it is shown that the bisected width of large 3-regular graphs with |V| vertices is at most 1/6 |V |.
35
New spectral lower bounds on the bisection width of graphs
TL;DR: This work defines some global expansion properties and shows that the spectral lower bound increases with this global expansion, and derives new lower bounds for the bisection widths of 3- and 4-regular Ramanujan graphs.
32
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets
Serge Gaspers,Gregory B. Sorkin +1 more
- 06 Jul 2015
TL;DR: The design is the design of a general method to integrate the advantage from the separator-branching into Measure and Conquer, for an improved running time analysis.
•Posted Content
Drawing Graphs on Few Lines and Few Planes
TL;DR: The problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes was studied in this article.
21