On the light side of geometric graphs

DOI10.1016/J.DISC.2011.12.009zbMATH Open1238.05177OpenAlexW2000939688MaRDI QIDQ409464FDOQ409464

Authors: Eyal Ackerman, Rom Pinchasi 

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.009

Recommendations

• A note on light geometric graphs
• Note on geometric graphs
• On geometric graphs with no \(k\) pairwise parallel edges
• The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
• On geometric graphs with no two edges in convex position

zbMATH Keywords

geometric graphs\(k\)-near bipartite

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• On geometric graphs with no \(k\) pairwise parallel edges
• Geometric graphs with few disjoint edges
• Geometric graphs with no self-intersecting path of length three
• Applications of the crossing number
• On disjoint crossing families in geometric graphs

Cited In (2)

• Title not available (Why is that?)
• A note on light geometric graphs

This page was built for publication: On the light side of geometric graphs

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