๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on graphs contraction-critical with respect to independence number

โœ Scribed by Plummer, Michael D.; Saito, Akira

Book ID
122186690
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
416 KB
Volume
325
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On graphs critical with respect to verte
On graphs critical with respect to vertex partition numbers
โœ Peter Mihรณk ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 362 KB

For k 3 0, pk(G) den ot e s the Lick-White vertex partition number of G. A graph G is called (n, k)-critical 'f 't I I is connected and for each edge e of G Pk (G -e) < pk (G) = n. We describe all (2, k&critical graphs and for n 23, k 2 1 we extend and simplify a result of Bollobas and Harary giving

Corrigendum to: on graphs critical with
Corrigendum to: on graphs critical with respect to edge-colourings
โœ H.P. Yap ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 37 KB

On graphs critical with respect to edge-colourings, Discrete Math. 37 (1981) 289-296. The error occurs in the proof of Case 2 of Theorem 5 (p. 294). We now revise the proof for Case 1 (p. 293) and Case 2 (p. 294) as follows: Case 1: jI # p. In this case, the terminal vertex of the (1, p)-chain with