𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the connectivity of diamond-free graphs

✍ Scribed by Peter Dankelmann; Angelika Hellwig; Lutz Volkmann

Book ID
111712841
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
147 KB
Volume
155
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On weakly diamond-free Berge graphs
On weakly diamond-free Berge graphs
✍ HacΓ¨ne Ait Haddadene; Sylvain Gravier πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 183 KB

In this paper, we present a new class of graphs named weakly diamond-Jree (WDF) graphs and we prove for it the strong perfect graph conjecture, by exhibiting a polynomial sequential (,)-coloring algorithm. This class contains chordal graphs and perfect line-graphs.

Hamilton connectivity of line graphs and
Hamilton connectivity of line graphs and claw-free graphs
✍ Zhiquan Hu; Feng Tian; Bing Wei πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract Let __G__ be a graph and let __V__~0~ = {ν∈ __V__(__G__): __d__~__G__~(Ξ½) = 6}. We show in this paper that: (i) if __G__ is a 6‐connected line graph and if |__V__~0~| ≀ 29 or __G__[__V__~0~] contains at most 5 vertex disjoint __K__~4~'s, then __G__ is Hamilton‐connected; (ii) every 8‐co

Spin Models on Triangle-Free Connected G
Spin Models on Triangle-Free Connected Graphs
✍ Kazumasa Nomura πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 388 KB

Spin models were introduced by V. Jones (Pac. J. Math. 137 (1989), 311 334) to construct invariants of knots and links. A spin model is defined as a pair S=(X, w) of a fine set X and a function w: X\_X Γ„ C satisfying several axioms. Let 1=(X, E) be a connected graph with the usual metric : X\_X Γ„ [0

On the connectivity of total graphs
On the connectivity of total graphs
✍ Takashi Hamada; Toshio Nonaka; Izumi Yoshimura πŸ“‚ Article πŸ“… 1972 πŸ› Springer 🌐 English βš– 360 KB