𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of 3-connected graphs containing a given graph

✍ Scribed by Seiya Negami

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
329 KB
Volume
32
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On graphs containing a given graph as ce
On graphs containing a given graph as center
✍ Fred Buckley; Zevi Miller; Peter J. Slater πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 367 KB πŸ‘ 1 views

## Abstract We examine the problem of embedding a graph __H__ as the center of a supergraph __G__, and we consider what properties one can restrict __G__ to have. Letting __A(H)__ denote the smallest difference ∣__V(G)__∣ ‐ ∣__V(H)__∣ over graphs __G__ having center isomorphic to __H__ it is demons

A characterization of weakly four-connec
A characterization of weakly four-connected graphs
✍ Tibor JordΓ‘n πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 106 KB

## Abstract A graph __G__ = (__V__, __E__) is called weakly four‐connected if __G__ is 4‐edge‐connected and __G__ βˆ’ __x__ is 2‐edge‐connected for all __x__ ∈ __V__. We give sufficient conditions for the existence of β€˜splittable’ vertices of degree four in weakly four‐connected graphs. By using thes

Some results on characterizing the edges
Some results on characterizing the edges of connected graphs with a given domination number
✍ Laura A. Sanchis πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v β€’ V-V' there exists some uβ€’ V' for which {v,u} β€’E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu

A recursive characterization of the 4-co
A recursive characterization of the 4-connected graphs
✍ Nicola Martinov πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 244 KB

We present a complete description of the set of 4-connected contraction-critical graphs.

On the largest tree of given maximum deg
On the largest tree of given maximum degree in a connected graph
✍ Y. Caro; I. Krasikov; Y. Roditty πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 258 KB πŸ‘ 1 views

## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__Ξ΄(__G__) + 1, where Ξ΄(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als