A direct decomposition of 3-connected planar graphs

zbMath1207.05086MaRDI QIDQ2654584

Manuel Bodirsky, Mihyun Kang, Clemens Gröpl, Daniel Johannsen

Publication date: 19 January 2010

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/227943

zbMATH Keywords

algorithmsplanar graphsrandom sampling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Random cubic planar graphs

Uses Software

• gfun

This page was built for publication: A direct decomposition of 3-connected planar graphs