The list \(L(2,1)\)-labeling of planar graphs with large girth

DOI10.1007/978-3-030-57602-8_45zbMath1482.05292OpenAlexW3048310841MaRDI QIDQ2039710

Zhu Junlei, Liu Ying, Zhu Haiyang, Wang Shuling, Miao Lianying, Huang Danjun

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_45

zbMATH Keywords

girthplanar graph\(L(2,1)\)-labeling1)\)-labeling numberlist \(L(2

Mathematics Subject Classification ID

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

Related Items

List injective coloring of planar graphs with disjoint 5−-cycles ⋮ Planar graphs without intersecting 5-cycles are signed-4-choosable ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling

Cites Work

• Unnamed Item
• 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
• Neighbor sum distinguishing index of subcubic graphs
• 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