Facial \(L(2, 1)\)-edge-labelings of trees
type: Item
instance of: scholarly article
title: Facial \(L(2, 1)\)-edge-labelings of trees
zbMATH Open document ID: 1394.05109
author: Július Czap
author: Juraj Valiska
author: Stanislav Jendroľ
published in: Discrete Applied Mathematics
publication date: 2018-09-06T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6933528
zbMATH Keywords: plane graph
zbMATH Keywords: boundary walk
zbMATH Keywords: edge-labeling
zbMATH Keywords: \(L(2, 1)\)-edge-labeling
MaRDI profile type: Publication
full work available at URL: j.dam.2018.03.081
OpenAlex ID: W2884554970
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Strong edge-colouring of sparse planar graphs
cites work: Q4501549
cites work: Approximations for -Colorings of Graphs
cites work: Q5422499
cites work: Labeling trees with a condition at distance two
cites work: \(L(h,1)\)-labeling subclasses of planar graphs
cites work: Strong chromatic index of planar graphs with large girth
cites work: Facially-constrained colorings of plane graphs: a survey
cites work: On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
cites work: Q5752590
cites work: Fixed-parameter complexity of \(\lambda\)-labelings
cites work: Labeling trees with a condition at distance two.
cites work: Q5475521
cites work: Labelling Graphs with a Condition at Distance 2
cites work: Topological graph theory.
cites work: \(L(1, 2)\)-edge-labelings for lattices
cites work: Strong edge-coloring of planar graphs
cites work: Computational complexity of distance edge labeling
cites work: On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
cites work: On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
cites work: Distance two edge labelings of lattices
cites work: \(\ell\)-facial edge colorings of graphs
cites work: A bound on the chromatic number of the square of a planar graph
cites work: The \(L(2,1)\)-labeling on planar graphs
cites work: Coloring the square of a planar graph
DOI: 10.1016/J.DAM.2018.03.081
description: scientific article; zbMATH DE number 6933528