scientific article; zbMATH DE number 3646924

MaRDI QIDQ3205253zbMATHFDO

Authors Janis Dambitis

Publication date 1977

zbMATH Keywords

algorithmembedding of nonplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Recommendations

• An efficient algorithm for embedding nonplanar graphs in planes
• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
• An algorithm of graph planarity testing and cross minimization
• Algorithms for graphs embeddable with few crossings per edge
• Fundamentals of Computation Theory
• On the crossing number of almost planar graphs
• On the Crossing Number of Almost Planar Graphs
• On graph crossing number and edge planarization
• An algorithm for the graph crossing number problem
• A new algorithm for embedding plane graphs at fixed vertex locations

Cited in

(1)

• Upper bounds for the number of facets of a simplicial complex

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