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

The Graph of Triangulations of a Point Configuration withd +4Vertices Is 3-Connected

โœ Scribed by M. Azaola; F. Santos

Book ID
106150147
Publisher
Springer
Year
2000
Tongue
English
Weight
309 KB
Volume
23
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The square of a connected S(K1,3)-free g
The square of a connected S(K1,3)-free graph is vertex pancyclic
โœ George Hendry; Walter Vogler ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 129 KB ๐Ÿ‘ 1 views

We prove the conjecture of Gould and Jacobson that a connected S(K1,J free graph has a vertex pancyclic square. Since .S(K1,J is not vertex pancyclic, this result is best possible. ## Our notation generally follows that used in [l] . A graph G is Hamilroniun if it contains a cycle through all its

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

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.

An upper bound for the radius of a 3-con
An upper bound for the radius of a 3-connected graph
โœ Jochen Harant ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

For a 3-connected graph with radius r containing n vertices, in [1] r < n/4 + O(log n) was proved and r < n/4 + const was conjectured. Here we prove r < n/4 + 8. Let G be a simple 3-connected finite graph on n vertices with vertex set V(G) and edge set E(G). For X, YE V(G) we denote by d(X, Y) the