Pages that link to "Item:Q885290"
From MaRDI portal
The following pages link to Minmax relations for cyclically ordered digraphs (Q885290):
Displaying 15 items.
- A min-max relation in flowgraphs (Q324741) (← links)
- On absorbing cycles in min-max digraphs (Q556011) (← links)
- 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)
- On integrality, stability and composition of dicycle packings and covers (Q1583704) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← 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)
- (Q4384645) (← links)
- A unified approach to known and unknown cases of Berge's conjecture (Q4650184) (← links)
- Integer Programming and Combinatorial Optimization (Q5712448) (← links)
- A network flow approach to a common generalization of Clar and Fries numbers (Q6589122) (← links)