scientific article; zbMATH DE number 2038777

zbMath1039.05057MaRDI QIDQ4449244

Manuel Bodirsky, Mihyun Kang, Clemens Gröpl

Publication date: 8 February 2004

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

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

zbMATH Keywords

polynomial time algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Classes of graphs embeddable in order-dependent surfaces ⋮ Phase transitions in discrete structures ⋮ Random graphs on surfaces ⋮ The structure of \(K_{3,3}\)-subdivision-free toroidal graphs ⋮ Random planar graphs ⋮ Colouring Random Empire Trees ⋮ Planar graphs, via well-orderly maps and trees ⋮ Random cubic planar graphs

This page was built for publication: