Distance two edge labelings of lattices
From MaRDI portal
Publication:1956249
DOI10.1007/s10878-012-9508-5zbMath1273.90229OpenAlexW2013838180MaRDI QIDQ1956249
Publication date: 13 June 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9508-5
triangular latticestrong productsquare latticestrong chromatic indexhexagonal lattice\(L(j,k)\)-edge-labeling numbercircular-\(L(j,k)\)-edge-labeling number
Related Items (9)
Facial \(L(2, 1)\)-edge-labelings of trees ⋮ Optimal L(j,k)-Edge-Labeling of Regular Grids ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice ⋮ L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus ⋮ \(L(1, 2)\)-edge-labelings for lattices ⋮ Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice ⋮ \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong edge-coloring for cubic Halin graphs
- The strong chromatic index of a class of graphs
- Distance-two labellings of Hamming graphs
- The strong chromatic index of a cubic graph is at most 10
- Labelling graphs with the circular difference
- Cyclic labellings with constraints at two distances
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- 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
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- Hamiltonicity and circular distance two labellings
This page was built for publication: Distance two edge labelings of lattices
