The 3‐connected graphs having a longest cycle containing only three contractible edges
From MaRDI portal
Publication:4201392
DOI10.1002/jgt.3190170310zbMath0778.05051MaRDI 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
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C40: Connectivity
05C45: Eulerian and Hamiltonian graphs
Related Items
Minimal locally cyclic triangulations of the projective plane, The 3‐connected graphs with a maximum matching containing precisely one contractible edge, Unnamed Item, Contractible edges in longest cycles in non-Hamiltonian graphs, A longest cycle version of Tutte's wheels theorem, On contractible and vertically contractible elements in 3-connected matroids and graphs, Contractible edges and removable edges in 3-connected graphs