The List \(L(2, 1)\)-labeling of planar graphs

DOI10.1016/J.DISC.2018.04.025zbMath1388.05164OpenAlexW2803890754MaRDI QIDQ1637136

Y. Aharonov

Publication date: 7 June 2018

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.04.025

zbMATH Keywords

planar graphs\(L(2, 1)\)-labelinglist \(L(2, 1)\)-labelinglist \(L(2, 1)\)-labeling number

Mathematics Subject Classification ID

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

Related Items (7)

On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ Unnamed Item ⋮ The list \(L(2,1)\)-labeling of planar graphs with large girth ⋮ Improper choosability of graphs and maximum average degree ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling ⋮ Two results on K-(2,1)-total choosability of planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles
• Distance constrained labelings of planar graphs with no short cycles
• Colorings and orientations of graphs
• List edge and list total colourings of multigraphs
• Labeling planar graphs with a condition at distance two
• On the \(L(p,1)\)-labelling of graphs
• A bound on the chromatic number of the square of a planar graph
• The \(L(2,1)\)-labelling of trees
• Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two
• Griggs and Yeh's Conjecture and $L(p,1)$-labelings
• Labelling Graphs with a Condition at Distance 2
• A Theorem about the Channel Assignment Problem
• Coloring the square of a planar graph
• Edge-partitions of planar graphs and their game coloring numbers

This page was built for publication: The List \(L(2, 1)\)-labeling of planar graphs