\(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
type: Item
instance of: scholarly article
title: \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
zbMATH Open document ID: 1387.05223
author: Márcia R. Cerioli
author: N. Martins
author: Daniel F. D. Posner
author: Rudini M. Sampaio
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6872078
zbMATH Keywords: \(L(2,1)\)-labelling
zbMATH Keywords: primeval decomposition
zbMATH Keywords: \((q,q-4)\)-graphs
MaRDI profile type: Publication
full work available at URL: j.disopt.2016.01.006
OpenAlex ID: W2278897491
cites work: Labelling Graphs with a Condition at Distance 2
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: Q4944992
cites work: Exact algorithms for \(L(2,1)\)-labeling of graphs
cites work: On the structure of graphs with few \(P_4\)s
cites work: Automata, Languages and Programming
cites work: On the \(L(p,1)\)-labelling of graphs
cites work: Q3579493
cites work: A tree representation for \(P_ 4\)-sparse graphs
cites work: \(P_{4}\)-laden graphs: A new class of brittle graphs
cites work: Relating path coverings to vertex labellings with a condition at distance two
DOI: 10.1016/J.DISOPT.2016.01.006
Recommended article: On the \(L(p,1)\)-labelling of graphs
Recommended article: Q3576665
Recommended article: Q5468089
Recommended article: On \(L (p, q)\)-labelling of planar graphs without cycles of length four
Recommended article: The \(L(p, q)\)-labelling of planar graphs without 4-cycles
Recommended article: Q4468997
Recommended article: Q4810748
Recommended article: Q3172286
Recommended article: Q3571907
Recommended article: The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs
description: scientific article; zbMATH DE number 6872078