Distance three labelings of trees
DOI10.1016/J.DAM.2011.02.004zbMATH Open1241.05123OpenAlexW2099793997MaRDI QIDQ415278FDOQ415278
Authors: Jiří Fiala, Petr A. Golovach, Bernard Lidický, Daniël Paulusma, Jan Kratochvíl 
Publication date: 11 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.02.004
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Algorithms for Square Roots of Graphs
- The complexity of satisfiability problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A survey on labeling graphs with a condition at distance two
- An exact algorithm for the channel assignment problem
- A distance-labelling problem for hypercubes
- \(L(h,1,1)\)-labeling of outerplanar graphs
- The $L(2,1)$-Labeling Problem on Graphs
- The \(L(h,1,1)\)-labelling problem for trees
- A coloring problem on the \(n\)-cube
- New bounds on a hypercube coloring problem.
- On a hypercube coloring problem
- Title not available (Why is that?)
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
- Fixed-parameter complexity of \(\lambda\)-labelings
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- On \(L(d,1)\)-labelings of graphs
- On improved exact algorithms for \(L(2,1)\)-labeling of graphs
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- Automata, Languages and Programming
- Graph labellings with variable weights, a survey
- Partial covers of graphs
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- \(L(2,1,1)\)-labeling is NP-complete for trees
- Tree Powers
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
Cited In (13)
- Distance-constrained labeling of complete trees
- Labeling trees with a condition at distance two
- The multi-level distance labeling for lobster tree
- Distance-constrained labellings of Cartesian products of graphs
- Title not available (Why is that?)
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
- \(L(2,1,1)\)-labeling is NP-complete for trees
- Linear and cyclic distance-three labellings of trees
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
- Automata, Languages and Programming
- Graph-Theoretic Concepts in Computer Science
- Title not available (Why is that?)
- Distance Constrained Labelings of Trees
This page was built for publication: Distance three labelings of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415278)
