Pages that link to "Item:Q3815326"

The following pages link to Longest cycles in 3-connected graphs contain three contractible edges (Q3815326):

Displayed 9 items.

• On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) ‎ (← links)
• 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)
• 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)
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge (Q4908826) ‎ (← links)
• (Q5139700) ‎ (← links)