Pages that link to "Item:Q1199122"

The following pages link to Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs (Q1199122):

Displaying 5 items.

• 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs (Q604983) (← links)
• Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs (Q686504) (← links)
• 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs (Q1895821) (← links)
• Two paths joining given vertices in \(2k\)-edge-connected graphs (Q2494109) (← links)
• The eavesdropping number of a graph (Q3070149) (← links)