Sciweavers

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

62

COMBINATORICS
1998

favoriteEmaildiscussreport

81views more COMBINATORICS 1998»

An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs

14 years 10 months ago

An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs

Download www.combinatorics.org

Michael Krivelevich

Real-time Traffic

COMBINATORICS 1998 |

claim paper

Related Content

» Minimizing Average Shortest Path Distances via Shortcut Edge Addition

» Ends and Vertices of Small Degree in Infinite Minimally kEdgeConnected Graphs

» Connectivity of Graphs Under Edge Flips

» Crossing Number and Weighted Crossing Number of NearPlanar Graphs

» ResourceBounded Information Gathering for Correlation Clustering

» Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

» A Simple and Fast Mincut Algorithm

» Crossing and Weighted Crossing Number of NearPlanar Graphs

» Improved pebbling bounds

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	COMBINATORICS
Authors	Michael Krivelevich

Comments (0)