Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice

DOI10.1137/07068552XzbMath1184.05112WikidataQ57601477 ScholiaQ57601477MaRDI QIDQ3648513

Petr Škoda, Daniel Král'

Publication date: 27 November 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

channel assignment problemgraph labelling with distance conditionsreal number graph labelling

Mathematics Subject Classification ID

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

Related Items (6)

Randomly colouring graphs (a combinatorial view) ⋮ Labeling the \(r\)-path with a condition at distance two ⋮ On real number labelings and graph invertibility ⋮ \(L(1, 2)\)-edge-labelings for lattices ⋮ L(h,k)-labelling for octagonal grid ⋮ Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures

Uses Software

• CALMA

This page was built for publication: Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice