✦ LIBER ✦

On 4-critical planar graphs with high edge density

✍ Scribed by Gerhard Koester

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 236 KB
Volume: 98
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90039-5

No coin nor oath required. For personal study only.

✦ Synopsis

Koester, G., On 4-critical planar graphs with high edge density, Discrete Mathematics 98 (1991) 147-151.

📜 SIMILAR VOLUMES

On the edge-reconstruction of 3-connecte

On the edge-reconstruction of 3-connected planar graphs with minimum valency 4

✍ Yue Zhao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 550 KB

It is shown that a 3-connected planar graph with minimum valency 4 is edge-reconstructible if no 4-vertex is adjacent to a 5-vertex. ## 1. Introduction In this paper, all graphs G=(V(G),E(G)) considered will be finite and simple. A connected graph G is said to have connectivity k o = ko(G) if the

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 fixed edge of planar graphs with

On the fixed edge of planar graphs with minimum degree five

✍ Baogang Xu; Hongbing Fan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 207 KB

An edge e of a finite and simple graph G is called a fixed edge of G if G -e + e' ~G implies e' = e. In this paper, we show that planar graphs with minimum degree 5 contain fixed edges, from which we prove that a class of planar graphs with minimum degree one is edge reconstructible.

Edge-disjoint homotopic paths in a plana

Edge-disjoint homotopic paths in a planar graph with one hole

✍ C van Hoesel; A Schrijver 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 967 KB

On minors of graphs with at least 3n −4

On minors of graphs with at least 3n −4 edges

✍ M. Khalifat; Themistocles Politof; A. Satyanarayana 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB 👁 1 views

## Abstract A point disconnecting set __S__ of a graph __G__ is a nontrivial __m__‐separator, where __m__ = |__S__|, if the connected components of __G__ ‐ __S__ can be partitioned into two subgraphs, each of which has at least two points. A 3‐connected graph is quasi 4‐connected if it has no nontr