Graph labellings with variable weights, a survey

DOI10.1016/j.dam.2008.08.024zbMath1211.05145OpenAlexW2116612642WikidataQ57601464 ScholiaQ57601464MaRDI QIDQ967309

Jerrold R. Griggs, Daniel Král'

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.08.024

zbMATH Keywords

channel assignment\(L(p,q)\)-labelingdistance constrained labelinglambda-graphreal number graph labeling

Mathematics Subject Classification ID

Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (16)

List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ Spectrum graph coloring and applications to Wi-Fi channel assignment ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction ⋮ Minimum gradation in greyscales of graphs ⋮ Distance three labelings of trees ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Fast Exact Algorithm for L(2,1)-Labeling of Graphs ⋮ On a distance-constrained graph labeling to model cooperation ⋮ Bounds on spectrum graph coloring ⋮ Radio $k$-labeling of paths ⋮ Labeling the \(r\)-path with a condition at distance two ⋮ On real number labelings and graph invertibility ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ Contrast in greyscales of graphs ⋮ Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(T\)-colorings of graphs: recent results and open problems
• Labeling trees with a condition at distance two.
• On \(L(d,1)\)-labelings of graphs
• An exact algorithm for the channel assignment problem
• On the span in channel assignment problems: Bounds, computing and counting
• Optimising channel assignments for private mobile radio networks in the UHF 2 band
• Cyclic labellings with constraints at two distances
• Labeling planar graphs with a condition at distance two
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• A bound on the chromatic number of the square of a planar graph
• Real Number Channel Assignments for Lattices
• Real Number Graph Labellings with Distance Conditions
• Labelings of Graphs with Fixed and Variable Edge-Weights
• Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs
• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• Approximations for  -Colorings of Graphs
• Graph distance‐dependent labeling related to code assignment in computer networks
• The $L(2,1)$-Labeling Problem on Graphs
• Coloring Powers of Chordal Graphs
• Nombre chromatique et plus longs chemins d'un graphe
• The Channel Assignment Problem with Variable Weights
• Models and solution techniques for frequency assignment problems
• Labeling trees with a condition at distance two
• Fixed-parameter complexity of \(\lambda\)-labelings

This page was built for publication: Graph labellings with variable weights, a survey