Facial \(L(2, 1)\)-edge-labelings of trees

DOI10.1016/j.dam.2018.03.081zbMath1394.05109OpenAlexW2884554970MaRDI QIDQ1671360

Juraj Valiska, Július Czap, Stanlislav Jendroľ

Publication date: 6 September 2018

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

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

zbMATH Keywords

plane graphedge-labeling\(L(2, 1)\)-edge-labelingboundary walk

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong chromatic index of planar graphs with large girth
• Strong edge-colouring of sparse planar graphs
• \(\ell\)-facial edge colorings of graphs
• The \(L(2,1)\)-labeling on planar graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Labeling trees with a condition at distance two.
• Computational complexity of distance edge labeling
• \(L(h,1)\)-labeling subclasses of planar graphs
• Distance two edge labelings of lattices
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
• Facially-constrained colorings of plane graphs: a survey
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
• A bound on the chromatic number of the square of a planar graph
• \(L(1, 2)\)-edge-labelings for lattices
• Labelling Graphs with a Condition at Distance 2
• Approximations for  -Colorings of Graphs
• Coloring the square of a planar graph
• Strong edge-coloring of planar graphs
• Labeling trees with a condition at distance two
• Fixed-parameter complexity of \(\lambda\)-labelings
• On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs

This page was built for publication: Facial \(L(2, 1)\)-edge-labelings of trees