A direct decomposition of 3-connected planar graphs

MaRDI QIDQ2654584zbMATHFDO

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

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algorithmsrandom samplingplanar graphs

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)

Recommendations

• Random sampling of large planar maps and convex polyhedra
• Generating unlabeled connected cubic planar graphs uniformly at random
• Algorithms and Computation
• scientific article; zbMATH DE number 2038777
• Generating labeled planar graphs uniformly at random

Cited in

(5)

• Random sampling of large planar maps and convex polyhedra
• \(\vec{P_3}\)-decomposition of directed graphs
• (3,3)-linked planar graphs
• Efficient reassembling of three-regular planar graphs
• Random cubic planar graphs

Describes a project that uses

Uses Software

• gfun

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

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