{"version":"1.0","type":"link","title":"K-outerplanar graph - Newikis","description":"In graph theory, a k-outerplanar graph is a planar graph that has a planar embedding in which the vertices belong to at most concentric layers. The outerplanarity index of a planar graph is the minimum value of for which it is -outerplanar.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/f/f7/Rhombic_dodecahedral_graph_layers.svg/1280px-Rhombic_dodecahedral_graph_layers.svg.png","thumbnail_width":1280,"thumbnail_height":1083}