Free Delivery Over $100
|
|
|||
|
||||
OverviewHigh Quality Content by WIKIPEDIA articles! In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a string. Given a graph G, G is a string graph if and only if there exists a set of curves, or strings, drawn in the plane such that no three strings intersect at a single point and such that the graph having a vertex for each curve and an edge for each intersecting pair of curves is isomorphic to G. Full Product DetailsAuthor: Lambert M. Surhone , Mariam T. Tennoe , Susan F. HenssonowPublisher: VDM Publishing House Imprint: VDM Publishing House Dimensions: Width: 22.90cm , Height: 0.70cm , Length: 15.20cm Weight: 0.196kg ISBN: 9786131234903ISBN 10: 6131234906 Pages: 126 Publication Date: 14 August 2010 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
