✦ LIBER ✦

GRAPHS EDGE-CRITICAL WITH RESPECT TO INDEPENDENCE NUMBER

✍ Scribed by Michael M. Krieger

Book ID: 114879188
Publisher: John Wiley and Sons
Year: 1970
Tongue: English
Weight: 224 KB
Volume: 175
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1970.tb56478.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on graphs contraction-critical wi

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

✍ Plummer, Michael D.; Saito, Akira 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 416 KB

On graphs critical with respect to edge-

On graphs critical with respect to edge-colourings

✍ Hian Poh Yap 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 698 KB

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

The independence number of an edge-chrom

The independence number of an edge-chromatic critical graph

✍ Douglas R. Woodall 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB 👁 1 views

A graph G with maximum degree and edge chromatic number (G)> is edge--critical if (G -e) = for every edge e of G. It is proved here that the vertex independence number of an edge--critical graph of order n is less than 3 5 n. For large , this improves on the best bound previously known, which was ro

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

Graphs with small numbers of independent

Graphs with small numbers of independent edges

✍ Miroslav M. Petrović; Ivan Gutman; Mirko Lepović 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 327 KB

The graphs with exactly one, two or three independent edges are determined.