𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distribution-Free Connectivity Testing for Sparse Graphs

✍ Scribed by Shirley Halevy; Eyal Kushilevitz

Book ID
106148789
Publisher
Springer
Year
2007
Tongue
English
Weight
487 KB
Volume
51
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Critical graphs for subpancyclicity of 3
Critical graphs for subpancyclicity of 3-connected claw-free graphs
✍ Ronald J. Gould; Tomasz Łuczak; Florian Pfender πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

## Abstract Let ${\cal{F}}\_{k}$ be the family of graphs __G__ such that all sufficiently large __k__ ‐connected claw‐free graphs which contain no induced copies of __G__ are subpancyclic. We show that for every __k__β‰₯3 the family ${\cal{F}}\_{1}k$ is infinite and make the first step toward the c

Wright's formulae for the number of conn
Wright's formulae for the number of connected sparsely edged graphs
✍ P. M. D. Gray; A. M. Murray; N. A. Young πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 161 KB

## Abstract We have written computer programs to determine exactly the coefficients in Wright's formula for __f(n, n + k)__, the number of connected sparsely edged labeled graphs (see preceding paper), and used them up to __k__ = 24. We give the results up to __k__ = 7.