scientific article; zbMATH DE number 2019629

zbMATH Open1028.68565MaRDI QIDQ4440432FDOQ4440432

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

Publication date: 17 December 2003

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

Title of this publication is not available (Why is that?)

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)

Cited In (5)

• Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
• Friendly bisections of random graphs
• Title not available (Why is that?)
• Bisecting sparse random graphs
• Bounds on the max and min bisection of random cubic and random 4-regular graphs

   Recommendations

• Bounds on the max and min bisection of random cubic and random 4-regular graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)