\(L(p,q)\)-labeling of sparse graphs
From MaRDI portal
Publication:1956243
DOI10.1007/s10878-012-9507-6zbMath1295.90097OpenAlexW2029976594MaRDI QIDQ1956243
Mickaël Montassier, Clément Charpentier, Andre Raspaud
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-9507-6
Related Items (7)
An improved bound on 2-distance coloring plane graphs with girth 5 ⋮ Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors ⋮ On \(L (p, q)\)-labelling of planar graphs without cycles of length four ⋮ \(L(p,q)\)-labeling of sparse graphs ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ L(h,k)-labelling for octagonal grid ⋮ \(L(p, q)\)-labeling of planar graphs with small girth
Cites Work
- Unnamed Item
- Unnamed Item
- \(L(p,q)\)-labeling of sparse graphs
- A survey on the distance-colouring of graphs
- Coloring the square of an outerplanar graph
- On the \(L(p,1)\)-labelling of graphs
- Labelling Graphs with a Condition at Distance 2
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- The $L(2,1)$-Labeling Problem on Graphs
This page was built for publication: \(L(p,q)\)-labeling of sparse graphs
