Login / Signup

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

Robert E. L. AldredRobert L. HemmingerKatsuhiro Ota
Published in: J. Graph Theory (1993)
Keyphrases