scientific article; zbMATH DE number 2019629

MaRDI QIDQ4440432zbMATH OpenFDO

Authors Norman Do, J. Díaz, Maria Serna, Nicholas Wormald

Publication date 17 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2483/24830114.htm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

• Bounds on the max and min bisection of random cubic and random 4-regular graphs
• scientific article; zbMATH DE number 125467
• The bisection width of cubic graphs
• On the minimum bisection of random 3-regular graphs
• Bounds on the bisection width for random \(d\)-regular graphs

Cited in

(7)

• Bounds on the max and min bisection of random cubic and random 4-regular graphs
• Note on the bisection width of cubic graphs
• Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
• scientific article; zbMATH DE number 4053679 (Why is no real title available?)
• scientific article; zbMATH DE number 125467 (Why is no real title available?)
• Bisecting sparse random graphs
• Friendly bisections of random graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440432)