\(L(3,2,1)\)-labeling of triangular and toroidal grids
From MaRDI portal
Publication:301947
DOI10.1007/s10100-014-0365-4zbMath1339.05404OpenAlexW2173324405MaRDI QIDQ301947
Publication date: 4 July 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-014-0365-4
Applications of graph theory (05C90) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Unnamed Item ⋮ On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span ⋮ Frequency assignment problem in networks with limited spectrum ⋮ Editorial ⋮ Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR ⋮ $L(3,2,1)$-labeling for Cylindrical grid: the cartesian product of a path and a cycle
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Circular coloring of graphs via linear programming and tabu search
- New heuristics for the vertex coloring problem based on semidefinite programming
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
- \(L(3,2,1)\)-labeling of graphs
- The \(L(h,1,1)\)-labelling problem for trees
- A distance-labelling problem for hypercubes
- \(L(h,1,1)\)-labeling of outerplanar graphs
- \(L(2,1)\)-labeling of strong products of cycles
- Improving heuristics for the frequency assignment problem
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- \(L(2,1)\)-labeling of direct product of paths and cycles
- Distance three labelings for direct products of three complete graphs
- The dynamic frequency assignment problem
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
This page was built for publication: \(L(3,2,1)\)-labeling of triangular and toroidal grids