𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the face touching number

✍ Scribed by Sanders, Daniel P.

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
399 KB
Volume
23
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

In a 3-connected plane graph, each pair of faces meet at at most either a vertex or an edge. Zha considered 3-connected graphs embedded on the projective plane, torus, and Klein bottle, showing that they meet at at most two, at most four, and a t most four vertices or edges, respectively, and demonstrated graphs that showed that these bounds were best possible. He asked the question on what the maximum number of times two faces can meet on a general surface. This paper solves that problem, showing that two faces of a graph embedded on a non-planar surface of Euler characteristic E meet at most 4 -2 ~ times. The proof uses the Discharging Method, and seems to be the first application of this method to a problem which is wholly about graph embeddings. Also, graphs are demonstrated to show that this result is best possible.

πŸ“œ SIMILAR VOLUMES

On the vertex face total chromatic numbe
On the vertex face total chromatic number of planar graphs
✍ Weifan, Wang; Jiazhuang, Liu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 471 KB πŸ‘ 2 views

Let G be a planar graph. The vertex face total chromatic number ,y13(G) of G is the least number of colors assigned to V(G) U F(G) such that no adjacent or incident elements receive the same color. The main results of this paper are as follows: (1) We give the vertex face total chromatic number for

The vertex-face total chromatic number o
The vertex-face total chromatic number of Halin graphs
✍ Lam, Peter C. B.; Zhang, Zhongfu πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 69 KB πŸ‘ 2 views

In this paper, we shall first prove that for a Halin graph G, 4 Β°xT (G) Β°6, where x T (G) is the vertex-face total chromatic number of G. Second, we shall establish a sufficient condition for a Halin graph to have a vertex-face total chromatic number of 6. Finally, we shall give a necessary and suff

The Face on the Milk Carton
The Face on the Milk Carton
✍ Caroline B. Cooney πŸ“‚ Fiction πŸ“… 1990;2009 πŸ› Random House Children's Books;Laure-Leaf 🌐 en-US βš– 139 KB

No one ever really paid close attention to the faces of the missing children on the milk cartons. But as Janie Johnson glanced at the face of the ordinary little girl with her hair in tight pigtails, wearing a dress with a narrow white collar--a three-year-old who had been kidnapped twelve years bef

On the number of shredders
On the number of shredders
✍ JordοΏ½n, Tibor πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 183 KB πŸ‘ 2 views

A subset S of k vertices in a k-connected graph G is a shredder, if G -S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [

On the Rabin number problem
On the Rabin number problem
✍ Duh, Dyi-Rong; Chen, Gen-Huey πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 247 KB πŸ‘ 1 views

Given positive integers k and l, let R(k, l) denote the class of interconnection networks so that for any k / 1 distinct nodes x, y 1 , y 2 , . . . , y k there exist k node-disjoint paths (except at x) of length at most l from x to y 1 , y 2 , . . . , y k , respectively. The Rabin number of a networ