𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on strong embeddings of maximal planar graphs on non-orientable sufraces

✍ Scribed by Liu Tongyin; Liu Yanpei

Book ID
107500472
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2001
Tongue
English
Weight
175 KB
Volume
16
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on some embedding problems for or
A note on some embedding problems for oriented graphs
✍ Andrew Treglown πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 88 KB

We conjecture that every oriented graph G on n vertices with + (G), -(G) β‰₯ 5n / 12 contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfe

A note on strong perfectness of graphs
A note on strong perfectness of graphs
✍ M. Preissmann; D. de Werra πŸ“‚ Article πŸ“… 1985 πŸ› Springer-Verlag 🌐 English βš– 263 KB
On the Number of Acute Triangles in a St
On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph
✍ Atsushi Kaneko; Hiroshi Maehara; Mamoru Watanabe πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 80 KB

In this paper we show that any maximal planar graph with m triangles except the unbounded face can be transformed into a straight-line embedding in which at least WmΓ‚3X triangles are acute triangles. Moreover, we show that any maximal outerplanar graph can be transformed into a straight-line embeddi

On universal graphs for planar oriented
On universal graphs for planar oriented graphs of a given girth
✍ O.V. Borodin; A.V. Kostochka; J. NeΕ‘etΕ™il; A. Raspaud; E. Sopena πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 662 KB

The oriented chromatic number o(H) of an oriented graph H is defined to be the minimum order of an oriented graph H' such that H has a homomorphism to H'. If each graph in a class ~ has a homomorphism to the same H', then H' is ~-universal. Let ~k denote the class of orientations of planar graphs wi