๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Strong-Diameter Decompositions of Minor Free Graphs

โœ Scribed by Ittai Abraham; Cyril Gavoille; Dahlia Malkhi; Udi Wieder

Publisher
Springer
Year
2010
Tongue
English
Weight
638 KB
Volume
47
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Choosability of K5-minor-free graphs
Choosability of K5-minor-free graphs
โœ Riste Sห‡krekovski ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 153 KB

Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all Ks-minor-free graphs are 5-choosable. (~) 1998 Elsevier Science B.V.

The Diameter of a Scale-Free Random Grap
The Diameter of a Scale-Free Random Graph
โœ Bรฉla Bollobรกs*; Oliver Riordan ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 350 KB
Size in maximal triangle-free graphs and
Size in maximal triangle-free graphs and minimal graphs of diameter 2
โœ Curtiss Barefoot; Karen Casey; David Fisher; Kathryn Fraughnaugh; Frank Harary ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 290 KB

A triangle-free graph is maximal if the addition of any edge creates a triangle. For n ~> 5, we show there is an n-node m-edge maximal triangle-free graph if and only if it is complete bipartite or 2n-5<<.m<<.L(n-1)2/4J+l. A diameter 2 graph is minimal if the deletion of any edge increases the diame