The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
type: Item
instance of: scholarly article
title: The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
zbMATH Open document ID: 1205.05225
author: R. Janczewski
author: Adrian Kosowski
author: Michal Malafiejski
published in: Discrete Mathematics
publication date: 2009-06-23T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5569073
zbMATH Keywords: \(L(p, q)\)-labeling
zbMATH Keywords: graphs of small degree
zbMATH Keywords: bipartite graphs
zbMATH Keywords: planar graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2008.09.028
OpenAlex ID: W2093844568
cites work: On powers of chordal graphs and their colorings
cites work: Approximations for -Colorings of Graphs
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
cites work: Fixed-parameter complexity of \(\lambda\)-labelings
cites work: Some simplified NP-complete graph problems
cites work: Q3838194
cites work: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
cites work: Hard tiling problems with simple tiles
cites work: A survey on labeling graphs with a condition at distance two
DOI: 10.1016/J.DISC.2008.09.028
description: scientific article; zbMATH DE number 5569073