\(L(2,1)\)-labeling of strong products of cycles
From MaRDI portal
Publication:1041747
DOI10.1016/j.ipl.2005.01.007zbMath1182.68148MaRDI QIDQ1041747
Aleksander Vesel, Danilo Korže
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.01.007
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
\(L(p,q)\)-labeling and integer tension of a graph embedded on torus, \(L(2,1)\)-labeling for brick product graphs, \(L(3,2,1)\)-labeling of triangular and toroidal grids, The \(L(2,1)\)-labeling on Cartesian sum of graphs, \(L(j, k)\)-number of direct product of path and cycle, Recent progress in mathematics and engineering on optimal graph labellings with distance conditions, L(h,k)-labelling for octagonal grid
Cites Work
- Unnamed Item
- Unnamed Item
- A randomised 3-colouring algorithm
- Relating path coverings to vertex labellings with a condition at distance two
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- Labelling Graphs with a Condition at Distance 2
- On the Shannon capacity of a graph
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]