Sciweavers

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

12

ENDM
2008

favoriteEmaildiscussreport

93views more ENDM 2008»

On Universal Graphs of Minor Closed Families

13 years 4 months ago

On Universal Graphs of Minor Closed Families

Download www.labri.fr

For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is an induced subgraph of U. In this paper, we give constructive proofs of new upper bounds for size and order of such minimal graphs for the family of graphs with no K-minor and more particularly on graphs of bounded treewidth.

Arnaud Labourel

Real-time Traffic

Constructive Proofs | ENDM 2008 | Minimal Graphs | Paper |

claim paper

Related Content

» Diameter and Treewidth in MinorClosed Graph Families Revisited

» Distributed Approximation Algorithms for Weighted Problems in MinorClosed Families

» Every MinorClosed Property of Sparse Graphs is Testable

» Path Separability of Graphs

» Embeddings of Topological Graphs Lossy Invariants Linearization and 2Sums

» Track Drawings of Graphs with Constant Queue Number

» Bidimensionality and geometric graphs

» A Canonical Form for Testing Boolean Function Properties

» First order properties on nowhere dense structures

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENDM
Authors	Arnaud Labourel

Comments (0)