Cart (Loading....) | Create Account
Close category search window
 

A Property of N-Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

T. A. J. Nicholson has introduced a restricted class of drawn graphs (N-graphs) into the problem of drawing a graph with a minimum number of crosspoints. This short note shows some defects in representing the capability of N-graphs by presenting a planar graph which cannot be represented by any N-graphs.

Published in:

Computers, IEEE Transactions on  (Volume:C-20 ,  Issue: 1 )

Date of Publication:

Jan. 1971

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.