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

DOI10.1016/J.DISC.2018.04.025zbMATH Open1388.05164OpenAlexW2803890754MaRDI QIDQ1637136FDOQ1637136

Authors: 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

Recommendations

• The list \(L(2,1)\)-labeling of planar graphs with large girth
• Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
• On list \((2,1)\)-labeling of some planar graphs.
• Labeling planar graphs with a condition at distance two
• The \(L(2,1)\)-labeling of planar graphs with maximum degree at most six

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)

Cites Work

• List edge and list total colourings of multigraphs
• Graph theory with applications
• The \(L(2,1)\)-labelling of trees
• Labelling Graphs with a Condition at Distance 2
• A bound on the chromatic number of the square of a planar graph
• Coloring the square of a planar graph
• Colorings and orientations of graphs
• Edge-partitions of planar graphs and their game coloring numbers
• On the \(L(p,1)\)-labelling of graphs
• A Theorem about the Channel Assignment Problem
• Title not available (Why is that?)
• Labeling planar graphs with a condition at distance two
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
• Labeling planar graphs without 4,5-cycles with a condition on distance two
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles
• Distance constrained labelings of planar graphs with no short cycles

Cited In (13)

• The \(L(2,1)\)-labeling on planar graphs
• Title not available (Why is that?)
• On list chromatic number of \(L(2,0)\)-labeling of a complete bipartite graph \(K_{2,n}\)
• The List \(L (p,q)\)-labelings of planar graphs with high maximum degree
• The list \(L(2,1)\)-labeling of planar graphs with large girth
• Improper choosability of graphs and maximum average degree
• On list \((2,1)\)-labeling of some planar graphs.
• The \(L (2,1)\)-choosability of cycle
• Two results on \(k\)-\((2,1)\)-total choosability of planar graphs
• A result on \(K\)-\((2,1)\)-total choosability of planar graphs
• Coloring squares of planar graphs with maximum degree at most five
• On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs
• Optimal frequency assignment and planar list \(L(2, 1)\)-labeling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1637136)