Sciweavers

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

3

DM
2008

favoriteEmaildiscussreport

48views more DM 2008»

Relative length of longest paths and longest cycles in triangle-free graphs

13 years 4 months ago

Relative length of longest paths and longest cycles in triangle-free graphs

Download www.dur.ac.uk

Daniël Paulusma, Kiyoshi Yoshimoto

Real-time Traffic

DM 2008 |

claim paper

Related Content

» Statistical BellmanFord algorithm with an application to retiming

» Cycles and paths in edgecolored graphs with given degrees

» Hamiltonian powers in threshold and arborescent comparability graphs

» Long Noncrossing Configurations in the Plane

» A sumoverpaths extension of edit distances accounting for all sequence alignments

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DM
Authors	Daniël Paulusma, Kiyoshi Yoshimoto

Comments (0)