Distance three labelings of trees
type: Item
instance of: scholarly article
title: Distance three labelings of trees
zbMATH Open document ID: 1241.05123
author: Jiří Fiala
author: Petr A. Golovach
author: Bernard Lidický
author: Daniël Paulusma
author: Jan Kratochvíl
published in: Discrete Applied Mathematics
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6033761
zbMATH Keywords: distance constrained graph labeling
zbMATH Keywords: linear distance
zbMATH Keywords: circular distance
MaRDI profile type: Publication
full work available at URL: j.dam.2011.02.004
OpenAlex ID: W2099793997
cites work: \(L(h,1,1)\)-labeling of outerplanar graphs
cites work: On \(L(d,1)\)-labelings of graphs
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Automata, Languages and Programming
cites work: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
cites work: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
cites work: Fixed-parameter complexity of \(\lambda\)-labelings
cites work: Partial covers of graphs
cites work: Q4448371
cites work: Q4198056
cites work: Systems of pairs of \(q\)-distant representatives, and graph colorings
cites work: L(2,1,1)-Labeling Is NP-Complete for Trees
cites work: Graph labellings with variable weights, a survey
cites work: An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
cites work: A Linear Time Algorithm for L(2,1)-Labeling of Trees
cites work: Exact algorithms for \(L(2,1)\)-labeling of graphs
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
cites work: Tree Powers
cites work: A coloring problem on the \(n\)-cube
cites work: The \(L(h,1,1)\)-labelling problem for trees
cites work: An exact algorithm for the channel assignment problem
cites work: Algorithms for Square Roots of Graphs
cites work: Q5466031
cites work: New bounds on a hypercube coloring problem.
cites work: On a hypercube coloring problem
cites work: The complexity of satisfiability problems
cites work: A survey on labeling graphs with a condition at distance two
cites work: A distance-labelling problem for hypercubes
DOI: 10.1016/J.DAM.2011.02.004
description: scientific article; zbMATH DE number 6033761