Paper Info
Title
Even directed cycles in H-free digraphs
Abstract
Abstract A digraph is H-free if its underlying graph does not contain a subgraph contractible to the graph H. We provide a polynomial-time algorithm to solve the Even Cycle Problem in the class of K3,3-free digraphs and in the class of K5-free digraphs. We also discuss the important role played by the subdivisions of K3,3 in solving the Even Cycle Problem in its generality.
Year
DOI
Venue
1998
10.1006/jagm.1997.0910
J. Algorithms
Keywords
DocType
Volume
h-free digraph
Journal
27
Issue
ISSN
Citations 
1
0196-6774
0
PageRank 
References 
Authors
0.34
6
2
Name
Order
Citations
PageRank
Anna Galluccio119323.05
Martin Loebl215228.66