Thirty Essays on Geometric Graph Theory

DOI10.1007/978-1-4614-0110-0MaRDI QIDQ2901845zbMATH OpenOpenAlexFDO

Authors

Publication date 31 July 2012

Full work available at URL https://doi.org/10.1007/978-1-4614-0110-0

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65) Erd?s problems and related topics of discrete geometry (52C10)

Cited in

(12)

• On Hamiltonian alternating cycles and paths
• Planar straight-line realizations of 2-trees with prescribed edge lengths
• Approximating the maximum rectilinear crossing number
• Graph Drawing via Gradient Descent, (GD)^2
• The complexity of drawing a graph in a polygonal region
• Counting plane graphs: cross-graph charging schemes
• Covering planar sets
• Unit-length rectangular drawings of graphs
• IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING?
• Improved hardness results for the clearing problem in financial networks with credit default swaps
• Recognition of unit segment and polyline graphs is \(\exists \mathbb{R} \)-complete
• On the maximal number of edges in a uniform hypergraph with one forbidden intersection

This page was built for publication: Thirty Essays on Geometric Graph Theory

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