𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Graphs with Prescribed Clique Number and Point-Arboricity

✍ Scribed by Mitchem, J.

Book ID
120097445
Publisher
Oxford University Press
Year
1971
Tongue
English
Weight
117 KB
Volume
s2-4
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the critical point-arboricity graphs
On the critical point-arboricity graphs
✍ Riste Škrekovski 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract In this paper, we study the critical point‐arboricity graphs. We prove two lower bounds for the number of edges of __k__‐critical point‐arboricity graphs. A theorem of Kronk is extended by proving that the point‐arboricity of a graph __G__ embedded on a surface __S__ with Euler genus __

On connectivity in graphs with given cli
On connectivity in graphs with given clique number
✍ Angelika Hellwig; Lutz Volkmann 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 1 views

## Abstract We consider finite, undirected, and simple graphs __G__ of order __n__(__G__) and minimum degree δ(__G__). The connectivity κ(__G__) for a connected graph __G__ is defined as the minimum cardinality over all vertex‐cuts. If κ(__G__) < δ(__G__), then Topp and Volkmann 7 showed in 1993 f

On local connectivity of graphs with giv
On local connectivity of graphs with given clique number
✍ Andreas Holtkamp; Lutz Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ κ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is

Regular graphs with prescribed chromatic
Regular graphs with prescribed chromatic number
✍ L. Caccetta; N. J. Pullman 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract We determine the minimum number of edges in a regular connected graph on __n__ vertices, containing a complete subgraph of order __k__ ≤ __n__/2. This enables us to confirm and strengthen a conjecture of P. Erdös on the existence of regular graphs with prescribed chromatic number.