𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The connectivity of a graph and its complement

✍ Scribed by Angelika Hellwig; Lutz Volkmann

Book ID
108112767
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
322 KB
Volume
156
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A remark on the connectivity of the comp
A remark on the connectivity of the complement of a 3-connected graph
✍ Kiyoshi Ando; Atsusi Kaneko πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 413 KB πŸ‘ 1 views

A graph G is said to be bi-3-connected if not only G but also its complement (~ are 3-connected and a two-vertex set whose contraction results in a bi-3-connected graph is called a bi-contractible pair of G. We prove that every bi-3-connected graph of order at least 22 has a bi-contractible pair.

Some parameters of graph and its complem
Some parameters of graph and its complement
✍ Shao-ji Xu πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 627 KB

In this paper, we have discussed the Nordhaus-Gaddum problems for diameter d, girth g, circumference c and edge covering number ill-We have both got the following results. If both G and G are connected, then 4<~d+a~~ 6, then p+2<.c+~<.2p, 3(p-1)<~c.~<.p 2. If both G and G have no isolated vertex, th

Packing triangles in a graph and its com
Packing triangles in a graph and its complement
✍ Peter Keevash; Benny Sudakov πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 1 views

## Abstract How few edge‐disjoint triangles can there be in a graph __G__ on __n__ vertices and in its complement $\overline {G}$? This question was posed by P. ErdΕ‘s, who noticed that if __G__ is a disjoint union of two complete graphs of order __n__/2 then this number is __n__^2^/12 + __o__(__n__