Cyclic labellings with constraints at two distances

zbMath1053.05111MaRDI QIDQ1883626

R. A. Leese, Steven D. Noble

Publication date: 13 October 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124019

zbMATH Keywords

distancescycleslabellingtrees

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (9)

Distance Constrained Labelings of Trees ⋮ Exact algorithms for \(L(2,1)\)-labeling of graphs ⋮ Distance two edge labelings of lattices ⋮ Circular \(L(j,k)\)-labeling number of direct product of path and cycle ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ Graph labellings with variable weights, a survey ⋮ Multiple \(L(j,1)\)-labeling of the triangular lattice ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs

This page was built for publication: Cyclic labellings with constraints at two distances