Packing directed circuits

Combinatorica

Volumn 16, Issue 4, 1996, Pages 535-554

  Reed, Bruce ^a   Robertson, Neil ^c   Seymour, Paul ^b   Thomas, Robin ^d  

^a SORBONNE UNIVERSITÉ   (France)

^b TELCORDIA TECHNOLOGIES   (United States)

^c OHIO STATE UNIVERSITY   (United States)

^d GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039336647     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01271272     Document Type: Article

References (8)

1. P. ERDÖS and L. PÓSA: On the independent circuits contained in a graph, Canad. J. Math., 17 (1965), 347-352.
2. P. ERDÖS and G. SZEKERES: A combinatorial problem in geometry, Compositio Math., 2 (1935), 463-470.
3. S. FORTUNE, J. E. HOPCROFT and J. WYLLIE: The directed subgraph homeomorphism problem, J. Theoret. Comput. Sci., 10 (1980), 111-121.
4. T. GALLAI: Problem 6, in Theory of Graphs, Proc. Colloq. Tihany 1966 (New York), Academic Press, 1968, p.362.
5. W. MCCUAIG: Intercyclic digraphs, Graph Structure Theory, (Neil Robertson and Paul Seymour, eds.), AMS Contemporary Math., 147 (1993), 203-245.
6. F. P. RAMSEY: On a problem of formal logic, Proc. London Math. Soc., 30 (1930), 264-286.
7. P. D. SEYMOUR: Packing directed circuits fractionally, Combinatorica, 15 (1995), 281-288.
8. D. H. YOUNGER: Graphs with interlinked directed circuits, Proceedings of the Midwest Symposium on Circuit Theory, 2 (1973), XVI 2.1 - XVI 2.7.