Multiple \(L(j,1)\)-labeling of the triangular lattice

DOI10.1007/s10878-012-9549-9zbMath1322.90107OpenAlexW1963603129MaRDI QIDQ2015807

Wensong Lin, Pu Zhang

Publication date: 24 June 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9549-9

zbMATH Keywords

\(L(j,k)\)-labeling number\(n\)-fold \(L(j,k)\)-labeling number\(n\)-fold circular \(L(j,k)\)-labeling numbercircular \(L(j,k)\)-labeling numbertriangular~lattice

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (3)

Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
• Multicoloring and Mycielski construction
• n-tuple colorings and associated graphs
• Labelling graphs with the circular difference
• Cyclic labellings with constraints at two distances
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• A survey on labeling graphs with a condition at distance two
• Multi-coloring the Mycielskian of graphs
• Labelling Graphs with a Condition at Distance 2
• Two Results Concerning Multicoloring
• Graph labeling and radio channel assignment
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• Hamiltonicity and circular distance two labellings

This page was built for publication: Multiple \(L(j,1)\)-labeling of the triangular lattice