Advertisement
Distance-Hereditary Graph Checker
distance preservation
Loading tool...
About Distance-Hereditary Graph Checker
A distance-hereditary graph checker testing if d_H(u,v) = d_G(u,v) for every connected induced subgraph H. Equivalent: no induced cycle ≥ 5 has no chord or exactly one chord. Cograph ⊂ distance-hereditary. O(n+m) recognition. Client-side.
Distance-Hereditary Graph Checker Features
- DH test
- Distance preserve
- Pruning seq
- O(n+m)
- Cograph gen
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 CheckerCograph Recognition Checker
View all 223 checkers toolsAdvertisement
Advertisement
Advertisement