scientific article; zbMATH DE number 5005324

MaRDI QIDQ3369055zbMATH OpenFDO

Authors Gunnar Brinkmann, Brendan D. McKay, U. von Nathusius

Publication date 13 February 2006

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 841996
• Face extensions in planar cubic graphs
• The structure of cubic planar graphs with triangular and hexagonal faces
• Hamiltonicity of cubic planar graphs with bounded face sizes
• On cubic polyhedral graphs with prescribed adjacency properties of their faces
• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
• Pathwidth of cubic graphs and exact algorithms
• A planarity criterion for cubic bipartite graphs
• Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
• Constructions for cubic graphs with large girth

Cited in

(3)

• The construction of cubic and quartic planar maps with prescribed face degrees
• Construction of planar triangulations with minimum degree 5
• The construction of cubic maps on orientable surfaces

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 Q3369055)