Graph Minor Checker

H ≤_m G minor relation

All Tools

Loading tool...

About Graph Minor Checker

A graph minor checker testing if H is a minor of G (obtainable by edge deletion, contraction, vertex deletion). Robertson-Seymour (2004): every minor-closed family has finite forbidden minors. Planar: no K_5 or K_{3,3} minor. Client-side.

Graph Minor Checker Features

  • Minor check
  • Wagner theorem
  • Robertson-Seymour
  • Forbidden minors
  • Common graphs
Advertisement
Advertisement