K-outerplanar graph
id:
k-outerplanar-graph-268-4672222
title:
K-outerplanar graph
text:
In graph theory, a k-outerplanar graph is a planar graph that has a planar embedding in which the vertices belong to at most k concentric layers. The outerplanarity index of a planar graph is the minimum value of k for which it is k -outerplanar.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/K-outerplanar_graph
date created:
date modified:
2024-02-20T23:52:02Z
main entity:
{"identifier":"Q60792992","url":"https://www.wikidata.org/entity/Q60792992"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/f/f7/Rhombic_dodecahedral_graph_layers.svg","width":468,"height":396}
fields total:
13
integrity:
14