{"version":"1.0","type":"link","title":"String graph - Newikis","description":"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, such that the graph having a vertex for each curve and an edge for each intersecting pair…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}