Graph Coarseness Calculator

edge-disjoint non-planar

All Tools

Loading tool...

About Graph Coarseness Calculator

A graph coarseness calculator computing ξ(G): maximum number of edge-disjoint non-planar subgraphs of G. Dual of skewness. ξ=0 iff planar. For K_n: ξ = ⌊(n+1)(n-3)/12⌋. Measures how 'densely non-planar' G is. Client-side.

Graph Coarseness Calculator Features

  • ξ(G)
  • Planar=0
  • Disjoint
  • vs skewness
  • Common graphs
Advertisement
Advertisement