Pages that link to "Item:Q4201392"
From MaRDI portal
The following pages link to The 3‐connected graphs having a longest cycle containing only three contractible edges (Q4201392):
Displaying 9 items.
- Contractible edges in longest cycles in non-Hamiltonian graphs (Q1336689) (← links)
- A longest cycle version of Tutte's wheels theorem (Q1369899) (← links)
- On contractible and vertically contractible elements in 3-connected matroids and graphs (Q1377720) (← links)
- Contractible edges and removable edges in 3-connected graphs (Q2287731) (← links)
- Contractible edges and longest cycles in 3-connected graphs (Q2689121) (← links)
- Minimal locally cyclic triangulations of the projective plane (Q4277985) (← links)
- The 3‐connected graphs with a maximum matching containing precisely one contractible edge (Q4277986) (← links)
- (Q5139700) (← links)
- Contractible edges in longest cycles (Q6074596) (← links)
