volume 30, issue 2, P311-320 2003
DOI: 10.1007/s00454-003-0012-9
View full text
|
|
Share

Abstract: A topological graph is a graph drawn in the plane so that its vertices are represented by points, and its edges are represented by Jordan curves connecting the corresponding points, with the property that any two curves have at most one point in common. We define two canonical classes of topological complete graphs, and prove that every topological complete graph with n vertices has a canonical subgraph of size at least c log 1/8 n, which belongs to one of these classes. We also show that every complete topol…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
17
0

Publication Types

Select...

Relationship

0
0

Authors

Journals