Sciweavers

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

7

SIAMDM
2010

favoriteEmaildiscussreport

95views more SIAMDM 2010»

Short Cycle Covers of Graphs with Minimum Degree Three

13 years 2 months ago

Short Cycle Covers of Graphs with Minimum Degree Three

Download iti.mff.cuni.cz

Tomás Kaiser, Daniel Král', Bernard

Real-time Traffic

SIAMDM 2010 |

claim paper

Related Content

» The upper bound of the number of cycles in a 2factor of a line graph

» Cycles and paths in edgecolored graphs with given degrees

» Approximating Maximum Subgraphs without Short Cycles

» Approximation Algorithms for Partial Covering Problems

» Pebbling and optimal pebbling in graphs

» Local Topological Toughness and Local Factors

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	SIAMDM
Authors	Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal

Comments (0)