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

DOI10.1007/S10878-021-00791-5MaRDI QIDQ2084641zbMATH OpenOpenAlexFDO

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

Recommendations

• The List L(2, 1)-labeling of planar graphs
• Labeling planar graphs with a condition at distance two
• Optimal channel assignment and \(L(p,1)\)-labeling
• The list \(L(2,1)\)-labeling of planar graphs with large girth
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem

Cites work

• A Theorem about the Channel Assignment Problem
• A bound on the chromatic number of the square of a planar graph
• Coloring squares of planar graphs with girth six
• Coloring the square of a planar graph
• Combinatorial Nullstellensatz
• Generalized list \(T\)-colorings of cycles
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Labeling planar graphs with a condition at distance two
• Labeling planar graphs without 4,5-cycles with a condition on distance two
• Labelling Graphs with a Condition at Distance 2
• Labelling planar graphs without 4-cycles with a condition on distance two
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• Neighbor sum distinguishing index of subcubic graphs
• On the \(L(p,1)\)-labelling of graphs
• Optimal channel assignment and \(L(p,1)\)-labeling
• The $L(2,1)$-Labeling Problem on Graphs
• The List L(2, 1)-labeling of planar graphs
• The L(2,1)-labelling of trees
• The L(p, q)-labelling of planar graphs without 4-cycles
• The list \(L(2,1)\)-labeling of planar graphs with large girth

Cited in

(3)

• The list \(L(2,1)\)-labeling of planar graphs with large girth
• The List L(2, 1)-labeling of planar graphs
• On list \((2,1)\)-labeling of some planar graphs.

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

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