𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large Isaacs' graphs are maximally non- Hamilton-connected

✍ Scribed by Rafał Kalinowski; Zdzisław Skupień

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
271 KB
Volume
82
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

saAold ya!dnys '[z] Ja8uyug pue yn.q3 dq UMO~S se u~yo)p~quou ~~.II~X~LU asp are sqde&i asou *[cl )sa!a uerl pue ualCoa OJ anp pue '(d~~~~~~~~~u~lequou) [p] $inf) 10 [s] SXXSI 0) anp slInsa1 atuos 111013 SMOIIOJ q3!q~ uyuo)lyeqoddq aJt? z e y ~J!M I+Tz[ sqdm% ,sxesI *(I+ yz olnpow peal aq 01 ale saD!pu! aql ala@ yz 3 j 9 0 ~03 r+Yp 'I+!pf~ 'l+W~ sa8pa q$!M laq)a%o] $ sqdeA4 I+ yz 30 uo!un ~u!o[s!p aq3 se (z e 7) I+=[ yh.48 ,SDDDSZ aq$ auyap aM [s] %u!~olIod +p put2 9 9 saD!yaA %u!%ueq pule kj xavaA c-aah?ap q,IM E'I_y news e aq !s la? v slqxa aql '3 3 a aspa kuv puv A 3 n 9 saqan iuam[pvuou 0~ hana loi '.jt @JO puv it qgtqq sj c isvay IV rapro Jo 3 ydm8 uv~uoq~uquou v l ([L]) irmuay

📜 SIMILAR VOLUMES

9-Connected Claw-Free Graphs Are Hamilto
9-Connected Claw-Free Graphs Are Hamilton-Connected
✍ Stephan Brandt 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 130 KB

A graph is Hamilton-connected if any pair of vertices is joined by a hamiltonian path. In this note it is shown that 9-connected graphs which contain no induced claw K 1, 3 are Hamilton-connected, by reformulating and localizing a closure concept due to Ryja c ek, which turns claw-free graphs into l

Non-traceability of large connected claw
Non-traceability of large connected claw-free graphs
✍ Frydrych, Wac?w; Skupie?, Zdzis?aw 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 3 views

Let G be a connected claw-free graph on n vertices. Let σ 3 (G) be the minimum degree sum among triples of independent vertices in G. It is proved that if σ 3 (G) ≥ n-3 then G is traceable or else G is one of graphs G n each of which comprises three disjoint nontrivial complete graphs joined togethe

Maximal K3's and Hamiltonicity of 4-conn
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs
✍ Jun Fujisawa; Katsuhiro Ota 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

## Abstract Let __cl__(__G__) denote Ryjáček's closure of a claw‐free graph __G__. In this article, we prove the following result. Let __G__ be a 4‐connected claw‐free graph. Assume that __G__[__N__~__G__~(__T__)] is cyclically 3‐connected if __T__ is a maximal __K__~3~ in __G__ which is also maxim

Minors in large almost-5-connected non-p
Minors in large almost-5-connected non-planar graphs
✍ Ken-Ichi Kawarabayashi; John Maharry 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB

## Abstract It is shown that every sufficiently large almost‐5‐connected non‐planar graph contains a minor isomorphic to an arbitrarily large graph from one of six families of graphs. The graphs in these families are also almost‐5‐connected, by which we mean that they are 4‐connected and all 4‐sepa