✦ LIBER ✦

On light edges and triangles in projective planar graphs

✍ Scribed by Sanders, Daniel P.

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 376 KB
Volume: 21
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199603)21:3<335::aid-jgt9>3.0.co;2-r

No coin nor oath required. For personal study only.

✦ Synopsis

An edge or face of an embedded graph is light if the sum of the degrees of the vertices incident with it is small. This paper parallelizes four inequalities on the number of light edges and light triangles from the plane to the projective plane. Each of the four inequalities is shown to be the best possible.

📜 SIMILAR VOLUMES

On paths in planar graphs

✍ Sanders, Daniel P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

This paper generalizes a theorem of Thomassen on paths in planar graphs. As a corollary, it is shown that every 4-connected planar graph has a Hamilton path between any two specified vertices x, y and containing any specified edge other than xy.

On certain Hamiltonian cycles in planar

On certain Hamiltonian cycles in planar graphs

✍ B�hme, T.; Harant, J.; Tk�?, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that mus

On cliques in spanning graphs of project

On cliques in spanning graphs of projective Steiner triple systems

✍ Frantisek Franek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

We are interested in the sizes of cliques that are to be found in any arbitrary spanning graph of a Steiner triple system S S. In this paper we investigate spanning graphs of projective Steiner triple systems, proving, not surprisingly, that for any positive integer k and any suf®ciently large proje