𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convex Embeddings and Bisections of 3-Connected Graphs1

✍ Scribed by Hiroshi Nagamochi; Tibor Jordán; Yoshitaka Nakao; Toshihide Ibaraki

Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
284 KB
Volume
22
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On convex embeddings of planar 3-connect
On convex embeddings of planar 3-connected graphs
✍ Kelmans, Alexander 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 2 views

A well-known Tutte's theorem claims that every 3-connected planar graph has a convex embedding into the plane. Tutte's arguments also show that, moreover, for every nonseparating cycle C of a 3-connected graph G, there exists a convex embedding of G such that C is a boundary of the outer face in thi

3-Connected line graphs of triangular gr
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
✍ H. J. Broersma; H. J. Veldman 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB 👁 1 views

A graph is k-triangular if each edge is in at least k triangles. Triangular is a synonym for l-triangular. It is shown that the line graph of a triangular graph of order at least 4 is panconnected if and only if it is 3-connected. Furthermore, the line graph of a k-triangular graph is k-harniltonian