Minmax relations for cyclically ordered digraphs

DOI10.1016/j.jctb.2006.09.005zbMath1117.05048OpenAlexW2144825483MaRDI QIDQ885290

András Sebő

Publication date: 8 June 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.09.005

zbMATH Keywords

orderscoveringpolyhedronstable setpackingminimum cost flowcoloringnetwork flow

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic orders: equivalence and duality
• Extending the Greene-Kleitman theorem to directed graphs
• k-optimal partitions of a directed graph
• Coflow polyhedra
• Anti-blocking polyhedra
• Circular chromatic number: A survey
• The structure of Sperner k-families

This page was built for publication: Minmax relations for cyclically ordered digraphs