scientific article; zbMATH DE number 3954891

zbMATH Open0594.03026MaRDI QIDQ3724317FDOQ3724317

Authors: Alfred B. Manaster, James H. Schmerl, Jeffrey Remmel 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• There are planar graphs almost as good as the complete graph
• The planar Cayley graphs are effectively enumerable. II
• A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
• scientific article; zbMATH DE number 4079189
• Computing planarity in computable planar graphs

zbMATH Keywords

planar graphconnected graphsminimal path algorithm presentation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Theory of numerations, effectively presented structures (03D45)

Cited In (4)

• Distanced graphs
• Title not available (Why is that?)
• Paths of low weight in planar graphs
• Evolved minimalist art and maximal planar graphs

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