Split Graph Checker

clique + independent set

All Tools

Loading tool...

About Split Graph Checker

A split graph checker testing if vertices can be partitioned into a clique K and independent set I. Equivalent: no induced C₄, C₅, or 2K₂. Split graphs are chordal and co-chordal. Degree sequence characterization. O(n+m) recognition. Client-side.

Split Graph Checker Features

  • Split test
  • K+I partition
  • Degree sequence
  • Chordal
  • O(n+m)
Advertisement
Advertisement