Notes on large angle crossing graphs

Details Notes on large angle crossing graphs Notes on large angle crossing graphs

2009-08-25

arxiv.org/abs/0908.3545v2

Computer Science

Data Structures and Algorithms

Scientific paper

A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges in G intersect at an angle of at least a. The concept of right angle crossing (RAC) graphs (a=Pi/2) was recently introduced by Didimo et. al. It was shown that any RAC graph with n vertices has at most 4n-10 edges and that there are infinitely many values of n for which there exists a RAC graph with n vertices and 4n-10 edges. In this paper, we give upper and lower bounds for the number of edges in aAC graphs for all 0 < a < Pi/2.

Affiliated with

Also associated with

No associations

Rating

Notes on large angle crossing graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Notes on large angle crossing graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Notes on large angle crossing graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-232845