𝔖 Bobbio Scriptorium
✦   LIBER   ✦

$L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3

✍ Scribed by Kang, Jeong-Hyun

Book ID
118197575
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
246 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

(d,1)-total labeling of graphs with a gi
(d,1)-total labeling of graphs with a given maximum average degree
✍ MickaΓ«l Montassier; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 166 KB πŸ‘ 1 views

## Abstract The (__d__,1)‐total number $\lambda \_{d}^{T}(G)$ of a graph __G__ is the width of the smallest range of integers that suffices to label the vertices and the edges of __G__ so that no two adjacent vertices have the same color, no two incident edges have the same color, and the distance

Acyclic edge coloring of graphs with max
Acyclic edge coloring of graphs with maximum degree 4
✍ Manu Basavaraju; L. Sunil Chandran πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 168 KB πŸ‘ 1 views

## Abstract An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__β€²(__G__). It was conj