scientific article; zbMATH DE number 4198021

zbMATH Open0726.05035MaRDI QIDQ5203028FDOQ5203028

Authors: Heiko Harborth, Ingrid Mengersen 

Publication date: 1990

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

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

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)

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
• Title not available (Why is that?)
• Graph Drawing
• Title not available (Why is that?)
• Crossing-free segments and triangles in point configurations
• Title not available (Why is that?)
• Complete graph drawings up to triangle mutations
• Title not available (Why is that?)
• Counting the regions in a regular drawing of \(K_{n,n}\)
• On edges crossing few other edges in simple topological complete graphs
• Title not available (Why is that?)

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)