The 3‐connected graphs having a longest cycle containing only three contractible edges

R. E L Aldred, Robert L. Hemminger, Katsuhiro Ota

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Fingerprint

Dive into the research topics of 'The 3‐connected graphs having a longest cycle containing only three contractible edges'. Together they form a unique fingerprint.

Mathematics