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

DOI10.1007/S10878-012-9549-9zbMATH Open1322.90107OpenAlexW1963603129MaRDI QIDQ2015807FDOQ2015807

Authors: Pu Zhang, Wensong Lin 

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

Recommendations

• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
• On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice
• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
• \(L(1, 2)\)-edge-labelings for lattices
• \(L (2,1)\)-circular labelings of Cartesian products of complete graphs

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)

Cites Work

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

Cited In (9)

• Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
• On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice
• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
• Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• Title not available (Why is that?)
• n-fold L(2, 1)-labelings of Cartesian product of paths and cycles
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015807)