Longest cycles in 3‐connected graphs contain three contractible edges

Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)

Fingerprint

Dive into the research topics of 'Longest cycles in 3‐connected graphs contain three contractible edges'. Together they form a unique fingerprint.

Mathematics