Sciweavers

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

66

Voted

JCT
2010

56views more JCT 2010»

Crossing-critical graphs with large maximum degree

15 years 1 months ago

Crossing-critical graphs with large maximum degree

Download www.imfm.si

Zdenek Dvorak, Bojan Mohar

Real-time Traffic

JCT 2010 |

claim paper

Related Content

» Large induced subgraphs with equated maximum degree

» An Efficient LowDegree RMST Algorithm for VLSIULSI Physical Design

» BoundedDegree Graphs have Arbitrarily Large Geometric Thickness

» SDPBased Algorithms for Maximum Independent Set Problems on Hypergraphs

» Induced Subgraphs of Bounded Degree and Bounded Treewidth

» Nearoptimum Universal Graphs for Graphs with Bounded Degrees

» A Bound on the Total Chromatic Number

» Embedding nearlyspanning bounded degree trees

» A randomized embedding algorithm for trees

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	JCT
Authors	Zdenek Dvorak, Bojan Mohar

Comments (0)