✦ LIBER ✦

On Consecutive labeling of plane graphs

✍ Scribed by Martin Bac̆a

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 219 KB
Volume: 328
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(91)90033-y

No coin nor oath required. For personal study only.

✦ Synopsis

This paper concerns a labeling problem of the plane graphs P,,. The present paper describes a nqic vertex labeling and a consecutive labeling ef type (0, I, I). These labelings combine to a consecutice labeling qf type (I, I, I).

📜 SIMILAR VOLUMES

On sequential labelings of graphs

✍ Thom Grace 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

A valuation on a simple graph G IS an assignment of labels to the vertices of G which induces an assignment of labels to the edges of G. pvaluations, also called graceful labelings, and a-valuations, a subclass of graceful labelings, have an extensive literature; harmonious labelings have been intro

A note on coverings of plane graphs

✍ Eduardo Rivera-Campo 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 1 views

## Abstract For any plane graph __G__ the number of edges in a minimum edge covering of the faces of __G__ is at most the vertex independence number of __G__ and the numbre of vertices in a minimum vertex covering of the faces of __G__ is at most the edge independence number of __G__. © 1995 John W

On magic labelings of type (1,1,1) for t

On magic labelings of type (1,1,1) for the special class of plane graphs

✍ Martin Bača 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 237 KB

The paper describes special ma~qic labelings gf' vertices, edges and ,faces qf' a special class of plane graphs ltlith 3-sided internal f&es, in which the labels of vertices and e&es incident with a,fkce sum to a value prescribedfor that face.

Planar graphs on the projective plane

✍ Bojan Mohar; Neil Robertson; Richard P. Vitray 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 958 KB

Labeling angles of planar graphs

✍ Feodor Loupekine; John J. Watkins 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 387 KB

A well-known theorem of Heawood states that 3-edge-coloring bridgeless planar cubic graphs-and, hence, the four-color theorem-is equivalent to labeling vertices with either +1 or -1 so that the sum around any face is 0 (mod 3). In this paper we introduce the notion of "angle-labeling" and give resul

On some properties of 4-regular plane gr

On some properties of 4-regular plane graphs

✍ Mirko Horňá; Stanislav Jendroľ 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 542 KB

## Abstract The __d__‐distance face chromatic number of a connected plane graph is the minimum number of colors in such a coloring of its faces that whenever two distinct faces are at the distance at most __d__, they receive distinct colors. We estimate 1‐distance chromatic number for connected 4‐r