Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

114

Voted

CPC
2010

88views more CPC 2010»

Directed Graphs Without Short Cycles

15 years 8 days ago

Directed Graphs Without Short Cycles

Download www.math.ucla.edu

Jacob Fox, Peter Keevash, Benny Sudakov

Real-time Traffic

CPC 2010 | Operations Research |

claim paper

Related Content

» Choosability of toroidal graphs without short cycles

» Computing Graph Roots Without Short Cycles

» Approximating Maximum Subgraphs without Short Cycles

» Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs

» Short cycle connectivity

» Note on edgecolored graphs and digraphs without properly colored cycles

» Minimum number of wavelengths equals load in a DAG without internal cycle

» Finding shortest nontrivial cycles in directed graphs on surfaces

» Short Transitive Signatures for Directed Trees

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	CPC
Authors	Jacob Fox, Peter Keevash, Benny Sudakov

Comments (0)