Pages that link to "Item:Q2689121"
From MaRDI portal
The following pages link to Contractible edges and longest cycles in 3-connected graphs (Q2689121):
Displaying 8 items.
- Contractible edges in longest cycles in non-Hamiltonian graphs (Q1336689) (← links)
- Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph (Q1865159) (← links)
- Removable edges and chords of longest cycles in 3-connected graphs (Q2014727) (← links)
- On the number of contractible edges of longest cycles in \(k\)-connected graphs (Q2993082) (← links)
- Longest cycles in 3-connected graphs contain three contractible edges (Q3815326) (← links)
- The 3‐connected graphs having a longest cycle containing only three contractible edges (Q4201392) (← links)
- (Q5319254) (← links)
- Contractible edges in longest cycles (Q6074596) (← links)