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

DOI10.1137/050632609zbMath1159.05045OpenAlexW2026367684MaRDI QIDQ3614202

Jeong-Hyun Kang

Publication date: 16 March 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050632609

zbMATH Keywords

graph labeling\(L(2,1)\)-labelinggeneralized coloringchanel assigment,

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (16)

A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) ⋮ L(3,1)-labeling of circulant graphs ⋮ A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) ⋮ On \(L(2,1)\)-labeling of generalized Petersen graphs ⋮ \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Graph labellings with variable weights, a survey ⋮ (2,1)-total labelling of trees with sparse vertices of maximum degree ⋮ \((2,1)\)-Total number of trees with maximum degree three ⋮ A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) ⋮ A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable ⋮ Linear and cyclic distance-three labellings of trees ⋮ THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE ⋮ \((2,1)\)-total labeling of trees with large maximum degree

This page was built for publication: $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3