Optimal frequency assignment and planar list \(L(2, 1)\)-labeling

DOI10.1007/s10878-021-00791-5zbMath1506.05185OpenAlexW3189764831MaRDI QIDQ2084641

Yanyan Li

Publication date: 18 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00791-5

zbMATH Keywords

list \(L(2, 1)\)-labeling number

Mathematics Subject Classification ID

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

Cites Work

• The \(L(p, q)\)-labelling of planar graphs without 4-cycles
• Labelling planar graphs without 4-cycles with a condition on distance two
• Optimal channel assignment and \(L(p,1)\)-labeling
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• The List \(L(2, 1)\)-labeling of planar graphs
• Generalized list \(T\)-colorings of cycles
• Neighbor sum distinguishing index of subcubic graphs
• The list \(L(2,1)\)-labeling of planar graphs with large girth
• Coloring squares of planar graphs with girth six
• 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
• Combinatorial Nullstellensatz
• A Theorem about the Channel Assignment Problem
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: Optimal frequency assignment and planar list \(L(2, 1)\)-labeling