✦ LIBER ✦

4-connected maximal planar graphs are 4-ordered

✍ Scribed by Wayne Goddard

Book ID: 108315775
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 84 KB
Volume: 257
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00438-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

4-Connected Projective-Planar Graphs Are

4-Connected Projective-Planar Graphs Are Hamiltonian

✍ R. Thomas; X.X. Yu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 923 KB

Generating planar 4-connected graphs

✍ David Barnette 📂 Article 📅 1973 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 498 KB

Hamiltonian cycles through prescribed ed

Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs

✍ F. Göring; J. Harant 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Edge-reconstruction of 4-connected plana

Edge-reconstruction of 4-connected planar graphs

✍ S. Fiorini; J. Lauri 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB 👁 2 views

## Abstract The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.

A linear algorithm for finding Hamiltoni

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs

✍ Takao Asano; Shunji Kikuchi; Nobuji Saito 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 901 KB

Maximal chromatic polynomials of connect

Maximal chromatic polynomials of connected planar graphs

✍ Ioan Tomescu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 429 KB 👁 1 views

## Abstract In this paper we obtain chromatic polynomials of connected 3‐ and 4‐chromatic planar graphs that are maximal for positive integer‐valued arguments. We also characterize the class of connected 3‐chromatic graphs having the maximum number of __p__‐colorings for __p__ ≥ 3, thus extending a