The List \(L(2, 1)\)-labeling of planar graphs
type: Item
instance of: scholarly article
title: The List \(L(2, 1)\)-labeling of planar graphs
zbMATH Open document ID: 1388.05164
author: Y. Aharonov
published in: Discrete Mathematics
publication date: 2018-06-07T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6882076
zbMATH Keywords: planar graphs
zbMATH Keywords: \(L(2, 1)\)-labeling
zbMATH Keywords: list \(L(2, 1)\)-labeling
zbMATH Keywords: list \(L(2, 1)\)-labeling number
MaRDI profile type: Publication
full work available at URL: j.disc.2018.04.025
OpenAlex ID: W2803890754
cites work: Colorings and orientations of graphs
cites work: Labeling planar graphs with a condition at distance two
cites work: Q3097395
cites work: Q3115641
cites work: List edge and list total colourings of multigraphs
cites work: Distance constrained labelings of planar graphs with no short cycles
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: Edge-partitions of planar graphs and their game coloring numbers
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: Coloring the square of a planar graph
cites work: The \(L(2,1)\)-labelling of trees
cites work: The \(L(p, q)\)-labelling of planar graphs without 4-cycles
cites work: Labeling planar graphs without 4,5-cycles with a condition on distance two
DOI: 10.1016/J.DISC.2018.04.025
description: scientific article; zbMATH DE number 6882076