Geometric graphs with no self-intersecting path of length three
type: Item
instance of: scholarly article
title: Geometric graphs with no self-intersecting path of length three
zbMATH Open document ID: 1050.05038
author: János Pach
author: Rom Pinchasi
author: Gábor Tardos
author: Géza Tóth
published in: European Journal of Combinatorics
publication date: 2004-10-04T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 2105716
zbMATH Keywords: geometric graph
zbMATH Keywords: self-intersecting path
zbMATH Keywords: straight-line edges
MaRDI profile type: Publication
full work available at URL: j.ejc.2003.09.019
OpenAlex ID: W2036775915
cites work: Quasi-planar graphs have a linear number of edges
cites work: Small forbidden configurations. II
cites work: Small forbidden configurations
cites work: Q3852212
cites work: Cycles of even length in graphs
cites work: On a Turán type problem of Erdős
cites work: Davenport-Schinzel theory of matrices
cites work: Q3048864
cites work: Q4263661
cites work: Graphs drawn with few crossings per edge
cites work: Q5477819
cites work: Topological graphs with no self-intersecting cycle of length 4
cites work: Toward a theory of crossing numbers
cites work: On geometric graphs with no \(k\) pairwise parallel edges
DOI: 10.1016/J.EJC.2003.09.019
description: scientific article; zbMATH DE number 2105716