The list \(L(2,1)\)-labeling of planar graphs with large girth
type: Item
instance of: scholarly article
title: The list \(L(2,1)\)-labeling of planar graphs with large girth
zbMATH Open document ID: 1482.05292
DOI: 10.1007/978-3-030-57602-8_45
author: Zhu Haiyang
author: Zhu Junlei
author: Liu Ying
author: Wang Shuling
author: Huang Danjun
author: Miao Lianying
publication date: 2021-07-05T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7367785
zbMATH Keywords: planar graph
zbMATH Keywords: girth
zbMATH Keywords: \(L(2,1)\)-labeling
zbMATH Keywords: list \(L(2
zbMATH Keywords: 1)\)-labeling number
MaRDI profile type: Publication
full work available at URL: 978-3-030-57602-8 45
OpenAlex ID: W3048310841
cites work: Combinatorial Nullstellensatz
cites work: Labeling planar graphs with a condition at distance two
cites work: Q3097395
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: On the \(L(p,1)\)-labelling of graphs
cites work: Labelling Graphs with a Condition at Distance 2
cites work: Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
cites work: Coloring the square of a planar graph
cites work: Neighbor sum distinguishing index of subcubic graphs
cites work: A Theorem about the Channel Assignment Problem
cites work: A bound on the chromatic number of the square of a planar graph
cites work: The \(L(2,1)\)-labelling of trees
cites work: Labelling planar graphs without 4-cycles with a condition on distance two
cites work: Labeling Planar Graphs with Conditions on Girth and Distance Two
cites work: List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
cites work: The \(L(p, q)\)-labelling of planar graphs without 4-cycles
cites work: The List \(L(2, 1)\)-labeling of planar graphs
cites work: Labeling planar graphs without 4,5-cycles with a condition on distance two
cites work: Optimal channel assignment and \(L(p,1)\)-labeling
description: scientific article; zbMATH DE number 7367785