\(L(2, 1)\)-labelling of graphs with few \(P_4\)'s

DOI10.1016/j.disopt.2016.01.006zbMath1387.05223OpenAlexW2278897491MaRDI QIDQ1751152

Daniel F. D. Posner, Nícolas A. Martins, Márcia R. Cerioli, Rudini Menezes Sampaio

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.01.006

zbMATH Keywords

\((q,q-4)\)-graphsprimeval decomposition\(L(2,1)\)-labelling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Exact algorithms for \(L(2,1)\)-labeling of graphs
• A tree representation for \(P_ 4\)-sparse graphs
• Relating path coverings to vertex labellings with a condition at distance two
• \(P_{4}\)-laden graphs: A new class of brittle graphs
• On the structure of graphs with few \(P_4\)s
• On the \(L(p,1)\)-labelling of graphs
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs
• Automata, Languages and Programming

This page was built for publication: \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s