Minmax relations for cyclically ordered digraphs

DOI10.1016/J.JCTB.2006.09.005MaRDI QIDQ885290zbMATH OpenOpenAlexFDO

Authors 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

coloringcoveringminimum cost flownetwork floworderspackingpolyhedronstable set

Mathematics Subject Classification ID

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

Recommendations

• Integer Programming and Combinatorial Optimization
• scientific article; zbMATH DE number 3910427
• Cyclic orders: equivalence and duality
• On integrality, stability and composition of dicycle packings and covers
• Packing directed circuits

Cites work

• Anti-blocking polyhedra
• Circular chromatic number: A survey
• Coflow polyhedra
• Cyclic orders: equivalence and duality
• Extending the Greene-Kleitman theorem to directed graphs
• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3628712 (Why is no real title available?)
• k-optimal partitions of a directed graph
• The structure of Sperner k-families

Cited in

(15)

• On integrality, stability and composition of dicycle packings and covers
• On the integral dicycle packings and covers and the linear ordering polytope
• The maximum vertex coverage problem on bipartite graphs
• Proof of Berge's strong path partition conjecture for \(k=2\)
• On the facets of stable set polytopes of circular interval graphs
• A min-max relation in flowgraphs
• Path Partitions, Cycle Covers and Integer Decomposition
• scientific article; zbMATH DE number 1145349 (Why is no real title available?)
• A unified approach to known and unknown cases of Berge's conjecture
• On absorbing cycles in min-max digraphs
• Integer Programming and Combinatorial Optimization
• A network flow approach to a common generalization of Clar and Fries numbers
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885290)