𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the closure of triangle-free graphs under substitution

✍ Scribed by Stephan Olariu

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
390 KB
Volume
34
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On decomposition of triangle-free graphs
On decomposition of triangle-free graphs under degree constraints
✍ Kaneko, Atsushi πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 80 KB πŸ‘ 2 views

We prove that if s and t are positive integers and if G is a triangle-free graph with minimum degree s + t, then the vertex set of G has a decomposition into two sets which induce subgraphs of minimum degree at least s and t, respectively.

On the asymptotic structure of sparse tr
On the asymptotic structure of sparse triangle free graphs
✍ PrοΏ½mel, Hans JοΏ½rgen; Steger, Angelika πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 567 KB

An important result of Erdos, Kleitman, and Rothschild says that almost every triangle-free graph on n vertices has chromatic number 2. In this paper w e study the asymptotic structure of graphs in y0rb,,,(K3), i.e., in the class of trianglefree graphs on n vertices having rn = rn(n) edges. In parti

On stability of Hamilton-connectedness u
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
✍ ZdenΔ›k RyjÑček; Petr VrΓ‘na πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 269 KB πŸ‘ 1 views

We show that, in a claw-free graph, Hamilton-connectedness is preserved under the operation of local completion performed at a vertex with 2-connected neighborhood. This result proves a conjecture by BollobΓ‘s et al.