Characterization results for the L(2, 1, 1)-labeling problem on trees

DOI10.7151/DMGT.1935zbMATH Open1366.05095OpenAlexW2549340483MaRDI QIDQ2364083FDOQ2364083

Authors: Kecai Deng, Xiaoling Zhang 

Publication date: 17 July 2017

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1935

Recommendations

• The \(L(h,1,1)\)-labelling problem for trees
• scientific article; zbMATH DE number 7295442
• scientific article; zbMATH DE number 2197903
• The \(L(2,1)\)-labelling of trees
• A note on \(L (2, 1)\)-labelling of trees
• An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
• \(L(2,1,1)\)-labeling is NP-complete for trees
• A linear time algorithm for \(L(2,1)\)-labeling of trees
• A Linear Time Algorithm for L(2,1)-Labeling of Trees

zbMATH Keywords

treediameter\(L(2, 1, 1)\)-labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• The \(L(2,1)\)-labelling of trees
• Labelling Graphs with a Condition at Distance 2
• A survey on labeling graphs with a condition at distance two
• A distance-labelling problem for hypercubes
• Distance three labelings for direct products of three complete graphs
• \(L(3,2,1)\)-labeling of graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The \(L(h,1,1)\)-labelling problem for trees
• Labeling trees with a condition at distance two.
• A Linear Time Algorithm for L(2,1)-Labeling of Trees
• Distance three labelings of trees
• \(L(2,1,1)\)-labeling is NP-complete for trees

Cited In (12)

• The \(L (d,1)\)-\(T\) labeling on claw-free graphs and splitted graphs
• Distance three labelings of trees
• Title not available (Why is that?)
• A note on \(L (2, 1)\)-labelling of trees
• Title not available (Why is that?)
• The \((p,q)\)-total labeling problem for trees
• The \(L(h,1,1)\)-labelling problem for trees
• A complete \(L (2, 1)\) span characterization for small trees
• The \(L(2,1)\)-labelling of trees
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata
• The (p,q)-total Labeling Problem for Trees

This page was built for publication: Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364083)