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

DOI10.1002/jgt.3190170310zbMath0778.05051OpenAlexW1985962973MaRDI QIDQ4201392

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

Publication date: 24 August 1993

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170310

zbMATH Keywords

3-connected graphlongest cyclecontractible edges

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Contractible edges in longest cycles in non-Hamiltonian graphs ⋮ Minimal locally cyclic triangulations of the projective plane ⋮ The 3‐connected graphs with a maximum matching containing precisely one contractible edge ⋮ A longest cycle version of Tutte's wheels theorem ⋮ On contractible and vertically contractible elements in 3-connected matroids and graphs ⋮ Contractible edges in longest cycles ⋮ Contractible edges and longest cycles in 3-connected graphs ⋮ Contractible edges and removable edges in 3-connected graphs ⋮ Unnamed Item

This page was built for publication: The 3‐connected graphs having a longest cycle containing only three contractible edges