Pages that link to "Item:Q885290"

The following pages link to Minmax relations for cyclically ordered digraphs (Q885290):

Displaying 8 items.

• Finding coherent cyclic orders in strong digraphs (Q949783) (← links)
• Cyclic orders: equivalence and duality (Q949788) (← links)
• The travelling preacher, projection, and a lower bound for the stability number of a graph (Q951102) (← links)
• The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
• Proof of Berge's strong path partition conjecture for \(k=2\) (Q2462329) (← links)
• On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
• Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
• A unified approach to known and unknown cases of Berge's conjecture (Q4650184) (← links)