✦ LIBER ✦

The game -labeling problem of graphs

✍ Scribed by Ma-Lian Chia; Huei-Ni Hsu; David Kuo; Sheng-Chyang Liaw; Zi-teng Xu

Book ID: 116410141
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 261 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.07.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The -labeling on graphs and the frequenc

The -labeling on graphs and the frequency assignment problem

✍ Zhendong Shao; Roger K. Yeh; David Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The Complexity of Bottleneck Labeled Gra

The Complexity of Bottleneck Labeled Graph Problems

✍ Refael Hassin; Jérôme Monnot; Danny Segev 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 482 KB

Label-connected graphs and the gossip pr

Label-connected graphs and the gossip problem

✍ F. Göbel; J.Orestes Cerdeira; H.J. Veldman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 791 KB

Gobel, F., J. Orestes Cerdeira and H.J. Veldman, Label-connected graphs and the gossip problem, Discrete Mathematics 87 (1991) 29-40. A graph with m edges is called label-connected if the edges can be labeled with real numbers in such a way that, for every pair (u, v) of vertices, there is a (u, v)

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

Antimagic Labeling of Cubic Graphs

✍ Liang, Yu-Chang; Zhu, Xuding 📂 Article 📅 2013 🏛 John Wiley and Sons 🌐 English ⚖ 485 KB

The -labeling on Cartesian sum of graphs

✍ Zhendong Shao; David Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 354 KB