✦ LIBER ✦

L(h, 1, 1)-labeling of outerplanar graphs

✍ Scribed by Tiziana Calamoneri; Emanuele G. Fusco; Richard B. Tan; Paola Vocca

Book ID: 105857512
Publisher: Springer
Year: 2008
Tongue: English
Weight: 684 KB
Volume: 69
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s00186-008-0261-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding k-Outerplanar Graphs into l1

✍ Chekuri, Chandra; Gupta, Anupam; Newman, Ilan; Rabinovich, Yuri; Sinclair, Alist 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 255 KB

Edge coloring by total labelings of oute

Edge coloring by total labelings of outerplanar graphs

✍ Wang, Guang Hui; Yan, Gui Ying 📂 Article 📅 2013 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 252 KB

On L(d,1)-labelings of graphs

✍ Gerard J. Chang; Wen-Tsai Ke; David Kuo; Daphne D.-F. Liu; Roger K. Yeh 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 116 KB

The L(2,1)-labeling and operations of gr

The L(2,1)-labeling and operations of graphs

✍ Zhendong Shao, ; Yeh, R.K. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 204 KB

A generalization of outerplanar graphs

✍ L. Oubiña; R. Zucchello 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 898 KB

l[Rt G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in the plane so that all vertices of W lie on the exterior face. We give a characterization of these graphs by forbidden subgraphs, an upper bound on the number of edges, and other properties which lead to an

A tight upper bound on the ()-total labe

A tight upper bound on the ()-total labeling number of outerplanar graphs

✍ Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono; Yushi Uno 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 512 KB