𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On graphs critical with respect to vertex partition numbers

✍ Scribed by Peter Mihók

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
362 KB
Volume
37
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 one construction of a family of (n, k&critical graphs of every possible order.

📜 SIMILAR VOLUMES

On vertex critical graphs with prescribe
On vertex critical graphs with prescribed diameter
✍ L. Caccetta; S. EL-Batanouny; J. Huang 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

## Abstract Let __G__ be connected simple graph with diameter __d__(__G__). __G__ is said __v__^+^‐critical if __d__(__G__−__v__) is greater than __d__(__G__) for every vertex __v__ of __G__. Let D′ = max {__d__(__G__−__v__) : __v__ ∈ __V__(__G__)}. Boals et al. [Congressus Numerantium 72 (1990), 1

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

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

Structural theorem on plane graphs with
Structural theorem on plane graphs with application to the entire coloring number
✍ Borodin, Oleg V. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB 👁 1 views

In 1973, Kronk and Mitchem (Discrete Math. (5) 255-260) conjectured that the vertices, edges and faces of each plane graph G may be colored with D(G) + 4 colors, where D(G) is the maximum degree of G, so that any two adjacent or incident elements receive distinct colors. They succeeded in verifying