scientific article; zbMATH DE number 4198021

MaRDI QIDQ5203028zbMATH OpenFDO

Authors Heiko Harborth, Ingrid Mengersen

Publication date 1990

zbMATH Keywords

drawingmaximum number of edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Publication:4862893
• Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics
• scientific article; zbMATH DE number 1161300
• scientific article; zbMATH DE number 434700
• scientific article; zbMATH DE number 140095

Cited in

(13)

• How many ways can one draw a graph?
• Bad drawings of small complete graphs
• On the maximum number of crossings in star-simple drawings of \(K_n\) with no empty lens
• scientific article; zbMATH DE number 840686 (Why is no real title available?)
• Graph Drawing
• scientific article; zbMATH DE number 475621 (Why is no real title available?)
• Complete graph drawings up to triangle mutations
• scientific article; zbMATH DE number 4139770 (Why is no real title available?)
• Crossing-free segments and triangles in point configurations
• scientific article; zbMATH DE number 3898914 (Why is no real title available?)
• Counting the regions in a regular drawing of \(K_{n,n}\)
• On edges crossing few other edges in simple topological complete graphs
• scientific article; zbMATH DE number 434700 (Why is no real title available?)

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