Pages that link to "Item:Q1078213"

The following pages link to A combinatorial bijection between linear extensions of equivalent orders (Q1078213):

Displayed 4 items.

• Computing the bump number is easy (Q1106863) ‎ (← links)
• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) ‎ (← links)
• Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) ‎ (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) ‎ (← links)