𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimally k-connected graphs of low order and maximal size

✍ Scribed by Cai Mao-cheng

Book ID
107748386
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
563 KB
Volume
41
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Size in maximal triangle-free graphs and
Size in maximal triangle-free graphs and minimal graphs of diameter 2
✍ Curtiss Barefoot; Karen Casey; David Fisher; Kathryn Fraughnaugh; Frank Harary πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 290 KB

A triangle-free graph is maximal if the addition of any edge creates a triangle. For n ~> 5, we show there is an n-node m-edge maximal triangle-free graph if and only if it is complete bipartite or 2n-5<<.m<<.L(n-1)2/4J+l. A diameter 2 graph is minimal if the deletion of any edge increases the diame

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