Sciweavers

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

11

DM
2000

favoriteEmaildiscussreport

91views more DM 2000»

Perfection thickness of graphs

13 years 4 months ago

Perfection thickness of graphs

Download www.math.uiuc.edu

We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.

Hirotsugu Asari, Tao Jiang, André Künd

Real-time Traffic

DM 2000 | Perfect Subgraphs | Worst-case Number |

claim paper

Related Content

» On Graph Thickness Geometric Thickness and Separator Theorems

» BoundedDegree Graphs have Arbitrarily Large Geometric Thickness

» Geometric Thickness of Complete Graphs

» On Representations of Some ThicknessTwo Graphs

» Duality of Ends

» The geometric thickness of low degree graphs

» Bar kVisibility Graphs Bounds on the Number of Edges Chromatic Number and Thickness

» Recognizing Perfect 2Split Graphs

» Graph Treewidth and Geometric Thickness Parameters

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	DM
Authors	Hirotsugu Asari, Tao Jiang, André Kündgen, Douglas B. West

Comments (0)