scientific article; zbMATH DE number 434700

zbMATH Open0792.05043MaRDI QIDQ3139539FDOQ3139539

Authors: Heiko Harborth, Ingrid Mengersen 

Publication date: 19 January 1994

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

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

zbMATH Keywords

complete graphcrossingplanedrawing

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• Graph Drawing
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• The Complexity of Several Realizability Problems for Abstract Topological Graphs
• Unavoidable patterns in complete simple topological graphs
• Title not available (Why is that?)
• On edges crossing few other edges in simple topological complete graphs
• Towards crossing-free Hamiltonian cycles in simple drawings of complete graphs
• Simple realizability of complete abstract topological graphs simplified
• The crossing number of twisted graphs
• Characterizing and recognizing 4-map graphs
• Unavoidable patterns in complete simple topological graphs
• Weighted Turán problems with applications
• Improved enumeration of 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)