Chordal Graph Checker

perfect elimination order

All Tools

Loading tool...

About Chordal Graph Checker

A chordal graph checker testing if every cycle of length ≥4 has a chord. Equivalent: has perfect elimination ordering (PEO). Chordal = intersection graph of subtrees. Perfect: χ=ω. Maximum cardinality search O(n+m). Client-side.

Chordal Graph Checker Features

  • Chordal test
  • PEO
  • χ = ω
  • MCS O(n+m)
  • Subtree intersection

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 CounterCircleboom Shadowban CheckerClash Royale Deck CheckerClash Royale Synergy CheckerCograph Recognition CheckerColor Contrast Checker
View all 223 checkers tools
Advertisement
Advertisement