✦ LIBER ✦

On graphs critical with respect to edge-colourings

✍ Scribed by Hian Poh Yap

Book ID: 107748379
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 698 KB
Volume: 37
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90227-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Colour-critical graphs with few edges

✍ A.V. Kostochka; M. Stiebitz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 569 KB

On the Number of Edges in Hypergraphs Cr

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings

✍ Alexandr V. Kostochka; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 94 KB

A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph (G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-cr

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

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

Definitions of criticality with respect

Definitions of criticality with respect to edge-coloring

✍ A. J. W. Helton 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB

## Abstract Here we examine six definitions of criticality concerning the chromatic index (edge chromatic number) of a simple graph. Five of these turn out to be almost always almost equivalent. Some problems arise and some conjectures are posed.