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

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

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

(15)

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

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)