scientific article

zbMath0976.68523MaRDI QIDQ2762518

Eike Seidel, Klaus Jansen, Andrzej Lingas, Marek Karpinski

Publication date: 9 January 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2010/20100365

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

Degree-constrained decompositions of graphs: Bounded treewidth and planarity ⋮ Bounds on the max and min bisection of random cubic and random 4-regular graphs ⋮ Bounds on the bisection width for random \(d\)-regular graphs ⋮ Bisection of bounded treewidth graphs by convolutions ⋮ On the minimum bisection of random 3-regular graphs ⋮ The complexity of finding uniform sparsest cuts in various graph classes ⋮ Unnamed Item ⋮ Pathwidth of cubic graphs and exact algorithms

This page was built for publication: