Matches in DBpedia 2016-04 for { ?s ?p "In graph theory, the thickness of a graph G is the minimum number of planar graphs into which the edges of G can be partitioned. That is, if there exists a collection of k planar graphs, all having the same set of vertices, such that the union of these planar graphs is G, then the thickness of G is at most k. In other words, the thickness of a graph is the minimal number of planar subgraphs whose union equals to graph G.Thus, a planar graph has thickness 1."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Thickness_(graph_theory) comment "In graph theory, the thickness of a graph G is the minimum number of planar graphs into which the edges of G can be partitioned. That is, if there exists a collection of k planar graphs, all having the same set of vertices, such that the union of these planar graphs is G, then the thickness of G is at most k. In other words, the thickness of a graph is the minimal number of planar subgraphs whose union equals to graph G.Thus, a planar graph has thickness 1.".
- Q18394143 comment "In graph theory, the thickness of a graph G is the minimum number of planar graphs into which the edges of G can be partitioned. That is, if there exists a collection of k planar graphs, all having the same set of vertices, such that the union of these planar graphs is G, then the thickness of G is at most k. In other words, the thickness of a graph is the minimal number of planar subgraphs whose union equals to graph G.Thus, a planar graph has thickness 1.".