✦ LIBER ✦

Apex graphs with embeddings of face-width three

✍ Scribed by Bojan Mohar

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 433 KB
Volume: 176
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00363-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Three-Coloring Graphs Embedded on Surfac

Three-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided

✍ J.P. Hutchinson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 765 KB

Every graph embedded on a surface of positive genus with every face bounded by an even number of edges can be 3-colored provided all noncontractible cycles in the graph are sufficiently long. The bound of three colors is the smallest possible for this type of result. 1995 Academic Press. Inc.

Face colorings of embedded graphs

✍ Dan Archdeacon 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB

We characterize those graphs which have at least one embedding into some surface such that the faces can be properly colored in four or fewer colors. Embeddings into both orientable and nonorientable surfaces are considered.

Face 2-Colourable Triangular Embeddings

Face 2-Colourable Triangular Embeddings of Complete Graphs

✍ M.J. Grannell; T.S. Griggs; Jozef Širáň 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 420 KB

A face 2-colourable triangulation of an orientable surface by a complete graph K n exists if and only if n#3 or 7 (mod 12). The existence of such triangulations follows from current graph constructions used in the proof of the Heawood conjecture. In this paper we give an alternative construction for

Classification of Minimal Graphs of Give

Classification of Minimal Graphs of Given Face-Width on the Torus

✍ A. Schrijver 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 666 KB

For any graph \(G\) embedded on the torus, the face-width \(r(G)\) of \(G\) is the minimum number of intersections of \(G\) and \(C\), where \(C\) ranges over all nonnullhomotopic closed curves on the torus. We call \(G r\)-minimal if \(r(G) \geqslant r\) and \(r\left(G^{\prime}\right)<r\) for each

On the embedding of graphs into graphs w

On the embedding of graphs into graphs with few eigenvalues

✍ Vu, Van H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

A graph is called of type k if it is connected, regular, and has k distinct eigenvalues. For example graphs of type 2 are the complete graphs, while those of type 3 are the strongly regular graphs. We prove that for any positive integer n, every graph can be embedded in n cospectral, non-isomorphic

Straight line embeddings of cubic planar

Straight line embeddings of cubic planar graphs with integer edge lengths

✍ Jim Geelen; Anjie Guo; David McKinnon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008