Geometric graphs with no self-intersecting path of length three

DOI10.1016/J.EJC.2003.09.019MaRDI QIDQ1883291zbMATH OpenOpenAlexFDO

Authors János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth

Publication date 4 October 2004

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2003.09.019

zbMATH Keywords

geometric graphself-intersecting pathstraight-line edges

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 1974129
• Geometric graphs with no three disjoint edges
• Topological graphs with no self-intersecting cycle of length 4
• scientific article; zbMATH DE number 2068176
• On geometric graphs with no two edges in convex position

Cites work

• scientific article; zbMATH DE number 3643294 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 1342089 (Why is no real title available?)
• scientific article; zbMATH DE number 5037083 (Why is no real title available?)
• Cycles of even length in graphs
• Davenport-Schinzel theory of matrices
• Graphs drawn with few crossings per edge
• On a Turán type problem of Erdős
• On geometric graphs with no k pairwise parallel edges
• Quasi-planar graphs have a linear number of edges
• Small forbidden configurations
• Small forbidden configurations. II
• Topological graphs with no self-intersecting cycle of length 4
• Toward a theory of crossing numbers

Cited in

(10)

• Extremal problems for pairs of triangles
• scientific article; zbMATH DE number 1974129 (Why is no real title available?)
• scientific article; zbMATH DE number 2068176 (Why is no real title available?)
• Topological graphs with no self-intersecting cycle of length 4
• An upper bound on the number of edges in an almost planar bipartite graph
• Construction of locally plane graphs with many edges
• Quantitative restrictions on crossing patterns
• Geometric graphs with no three disjoint edges
• On the light side of geometric graphs
• Structure and properties of locally outerplanar graphs

This page was built for publication: Geometric graphs with no self-intersecting path of length three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883291)