𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Colour-critical graphs with few edges

✍ Scribed by A.V. Kostochka; M. Stiebitz

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
569 KB
Volume
191
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Color-critical graphs and hypergraphs wi
Color-critical graphs and hypergraphs with few edges and no short cycles
✍ H.L. Abbott; D.R. Hare; B. Zhou πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 378 KB

We give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or shorter and with relatively few edges.

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

Edge-colouring random graphs
Edge-colouring random graphs
✍ A.M Frieze; B Jackson; C.J.H McDiarmid; B Reed πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 653 KB
On edge-colouring indifference graphs
On edge-colouring indifference graphs
✍ Celina M.H. de Figueiredo; JoΓ£o Meidanis; CΓ©lia Picinin de Mello πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 1020 KB
On Critical Edges in Minimal Imperfect G
On Critical Edges in Minimal Imperfect Graphs
✍ AndrΓ‘s Sebő πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 725 KB

An edge of a graph is called critical, if deleting it the stability number of the graph increases, and a nonedge is called co-critical, if adding it to the graph the size of the maximum clique increases. We prove in this paper, that the minimal imperfect graphs containing certain configurations of t