scientific article; zbMATH DE number 434700

MaRDI QIDQ3139539zbMATH OpenFDO

Authors Heiko Harborth, Ingrid Mengersen

Publication date 19 January 1994

zbMATH Keywords

complete graphcrossingplanedrawing

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(30)

• How many ways can one draw a graph?
• Fan-crossing free graphs and their relationship to other beyond-planar graphs
• Twisted ways to find plane structures in simple drawings of complete graphs
• On fan-crossing graphs
• scientific article; zbMATH DE number 840686 (Why is no real title available?)
• Graph Drawing
• scientific article; zbMATH DE number 3898914 (Why is no real title available?)
• Enumeration of simple complete topological graphs
• Enumeration of simple complete topological graphs
• Drawing of a graph on a surface
• Notes on the twisted graph
• On fan-crossing and fan-crossing free graphs
• Characterizing 5-map graphs by 2-fan-crossing graphs
• Monochromatic spanning trees and matchings in ordered complete graphs
• A note on the cross-index of a complete graph based on a linear tree
• scientific article; zbMATH DE number 4185631 (Why is no real title available?)
• The Complexity of Several Realizability Problems for Abstract Topological Graphs
• Unavoidable patterns in complete simple topological graphs
• On edges crossing few other edges in simple topological complete graphs
• scientific article; zbMATH DE number 3914340 (Why is no real title available?)
• Simple realizability of complete abstract topological graphs simplified
• Characterizing and recognizing 4-map graphs
• Towards crossing-free Hamiltonian cycles in simple drawings of complete graphs
• The crossing number of twisted graphs
• Improved enumeration of simple topological graphs
• Weighted Turán problems with applications
• Unavoidable patterns in complete simple topological graphs
• Convex drawings of the complete graph: topology meets geometry
• The number of crossings in a regular drawing of the complete bipartite graph
• Simple realizability of complete abstract topological graphs in P

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