Cograph Recognition Checker

P₄-free recognition

All Tools

Loading tool...

About Cograph Recognition Checker

A cograph recognition checker testing if a graph is P₄-free (no induced path on 4 vertices). Cographs = recursively built by complement and disjoint union. Cotree decomposition. χ = ω for cographs (perfect). O(n+m) recognition. Client-side.

Cograph Recognition Checker Features

  • P₄-free test
  • Cotree
  • χ = ω
  • O(n+m)
  • Decomposition

More Checkers Tools

Explore all 223 other checkers tools available on Generatr

Academic Readability Graderads.txt ValidatorAI Content DetectorAlexander McQueen Serial Number CheckerAnagram CheckerAnalog Gem Tester SimulatorAnsible LinterArc-Transitive Graph CheckerAudemars Piguet Serial Number CheckerAuto Parts Compatibility CheckerBike Serial Number CheckerBlocked Checker TwitterBluesky Block CheckerBottega Veneta Serial Number CheckerBrawl Stars Mastery CheckerBulk SERP CheckerBulova Serial Number CheckerCanned Phrase & Cliche CheckerCar Stereo Compatibility CheckerCartier Love Bracelet Serial Number CheckerCartier Serial Number CheckerCeline Serial Number CheckerCetaphil Lot Number CheckerCGC Certification LookupCharacter Frequency CounterChordal Graph CheckerCircleboom Shadowban CheckerClash Royale Deck CheckerClash Royale Synergy CheckerColor Contrast Checker
View all 223 checkers tools
Advertisement
Advertisement