\(L(p,q)\)-labeling of a graph embeddable on the torus
From MaRDI portal
Publication:400502
DOI10.1016/j.dam.2014.03.003zbMath1298.05281OpenAlexW2180188446MaRDI QIDQ400502
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.003
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- The \(L(2,1)\)-labeling on planar graphs
- Graphs on the torus and geometry of numbers
- Colorings of plane graphs: a survey
- A bound on the chromatic number of the square of a planar graph
- Labelling Graphs with a Condition at Distance 2
- A Theorem about the Channel Assignment Problem
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Coloring the square of a planar graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(L(p,q)\)-labeling of a graph embeddable on the torus