Elegant distance constrained labelings of trees

Authors:
Jiří Fiala;Petr A. Golovach;Jan Kratochvíl
Affiliations:
Institute for Theoretical Computer Science, and Department of Applied Mathematics, Charles University, Prague;Department of Applied Mathematics, Syktyvkar State University, Syktyvkar, Russia;Institute for Theoretical Computer Science, and Department of Applied Mathematics, Charles University, Prague
Venue:
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Year:
2004

Citing 10
Cited 3

The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Easy problems for tree-decomposable graphs

Journal of Algorithms
Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
Algorithms for Square Roots of Graphs

SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs

SIAM Journal on Discrete Mathematics
Tree powers

Journal of Algorithms
Distance Constrained Labeling of Precolored Trees

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Channel Assignment on Strongly-Simplicial Graphs

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Graph labeling and radio channel assignment

Journal of Graph Theory

Labeling bipartite permutation graphs with a condition at distance two

Discrete Applied Mathematics
L(2, 1, 1)-labeling is NP-complete for trees

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Distance three labelings of trees

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In our contribution to the study of graph labelings with three distance constraints we introduce a concept of elegant labelings: labelings where labels appearing in a neighborhood of a vertex can be completed into intervals such that these intervals are disjoint for adjacent vertices. We justify introduction of this notion by showing that use of these labelings provides good estimates for the span of the label space, and also provide a polynomial time algorithm to find an optimal elegant labeling of a tree for distance constraints (p,1,1). In addition several computational complexity issues are discussed.