✦ LIBER ✦

-labeling of oriented planar graphs

✍ Scribed by Calamoneri, T.; Sinaimeri, B.

Book ID: 122643854
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 252 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.07.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

2-dipath and oriented L(2, 1)-labelings

2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs

✍ Sagnik Sen 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 182 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

Planar acyclic oriented graphs

✍ Carsten Thomassen 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 725 KB

A plane Hasse representation of an acyclic oriented graph is a drawing of the graph in the Euchdean plane such that all arcs are straight-line segments directed upwards and such that no two arcs cross. We characterize completely those oriented graphs which have a plane Hasse representation such that

Orienting planar graphs

✍ G.R. Kampen 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 580 KB

It is &own that every rnzknal plsnar graph Itriangulakn) can be contracted at an arbitrary point (by identifying it with an adjacent point) c,o that triangularity is preserved. This is used as B lemma to prove that every triangulation con be (a) oriented so that with threg: exceptions every point hs

A Characterization of Planar Oriented Gr

A Characterization of Planar Oriented Graphs

✍ Ulrich, John Wade 📂 Article 📅 1970 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 832 KB

Homomorphism bounds for oriented planar

Homomorphism bounds for oriented planar graphs

✍ T. H. Marshall 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract If ${\cal C}$ is a class of oriented graphs (directed graphs without opposite arcs), then an oriented graph is a __homomorphism bound__ for ${\cal C}$ if there is a homomorphism from each graph in ${\cal C}$ to __H__. We find some necessary conditions for a graph to be a homomorphism bo