Minmax relations for cyclically ordered digraphs-Reference-Cited by-同舟云学术

Minmax relations for cyclically ordered digraphs

Published:2007-07 Issue:4 Volume:97 Page:518-552
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Sebő András

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference16 articles.

1. Integer rounding and polyhedral decomposition for totally unimodular systems;Baum,1978

2. k-Optimal partitions of a directed graph;Berge;European J. Combin.,1982

3. S. Bessy, Stabilité et décomposition en circuits d'un digraphe, thèse pour l'obtention du diplôme de doctorat, Université Claude Bernard, Lyon I, December 2003

4. S. Bessy, personal communication

5. S. Bessy, S. Thomassé, Spanning a strong digraph by α circuits: A proof of Gallai's conjecture, in: Bienstock, Nemhauser (Eds.), Integer Programming and Combinatorial Optimization, vol. 10, New York, 2004

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A network flow approach to a common generalization of Clar and Fries numbers;Discrete Mathematics;2024-11

2. The maximum vertex coverage problem on bipartite graphs;Discrete Applied Mathematics;2014-03

3. Sink-Stable Sets of Digraphs;SIAM Journal on Discrete Mathematics;2014-01

4. Packing and covering with linear programming: A survey;European Journal of Operational Research;2013-06

5. Dual Integrality in Combinatorial Optimization;Handbook of Combinatorial Optimization;2013