The bisection width of cubic graphs

For a graph G, define the bisection width bw(G) of G as min { eG(A,B): {A,B} partitions V(G) with ‖A| − |B‖ ≤ 1 } where eG(A, B) denotes the number of edges in G with one end in A and one end in B. We show almost every cubic graph G of order n has bw(G) ≥ n/11 while every such graph has bw(G) ≤ (n +...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Bulletin of the Australian Mathematical Society 1989-06, Vol.39 (3), p.389-396
Hauptverfasser:	Clark, L.H., Entringer, R.C.
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Combinatorics. Ordered structures Exact sciences and technology Graph theory Mathematics Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!