The \(L(p, q)\)-labelling of planar graphs without 4-cycles
type: Item
instance of: scholarly article
title: The \(L(p, q)\)-labelling of planar graphs without 4-cycles
zbMATH Open document ID: 1297.05211
author: Hai-Yang Zhu
author: Wei Chen
author: Lifeng Hou
author: Xin-Zhong Lu
published in: Discrete Applied Mathematics
publication date: 2014-09-12T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6344100
zbMATH Keywords: \(L(p,q)\)-labelling
zbMATH Keywords: planar graphs
zbMATH Keywords: cycles
zbMATH Keywords: Wegner's conjecture
MaRDI profile type: Publication
full work available at URL: j.dam.2013.08.039
OpenAlex ID: W2015437014
cites work: On the total coloring of planar graphs.
cites work: Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
cites work: 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
cites work: Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
cites work: List \((p,q)\)-coloring of sparse plane graphs
cites work: Q3115641
cites work: Coloring squares of planar graphs with girth six
cites work: Distance constrained labelings of planar graphs with no short cycles
cites work: On the \(L(p,1)\)-labelling of graphs
cites work: Graph labellings with variable weights, a survey
cites work: Labelling Graphs with a Condition at Distance 2
cites work: Choosability of the square of planar subcubic graphs with large girth
cites work: Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
cites work: List Colouring Squares of Planar Graphs
cites work: Q3115232
cites work: A Theorem about the Channel Assignment Problem
cites work: A survey on the distance-colouring of graphs
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: 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: Labeling planar graphs without 4,5-cycles with a condition on distance two
DOI: 10.1016/J.DAM.2013.08.039
Recommended article: On \(L (p, q)\)-labelling of planar graphs without cycles of length four
Recommended article: Q3110717
Recommended article: Q5398997
Recommended article: The \(L(p,q)\)-labeling of planar graphs without cycles of length from 4 to 9
Recommended article: Labelling planar graphs without 4-cycles with a condition on distance two
Recommended article: Labeling planar graphs without 4,5-cycles with a condition on distance two
Recommended article: \(L(p, q)\)-labeling of planar graphs with small girth
Recommended article: \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
Recommended article: The \(L(2,1)\)-labeling on planar graphs
Recommended article: Q5453047
description: scientific article; zbMATH DE number 6344100