On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
From MaRDI portal
Publication:5963630
DOI10.1007/s10878-014-9746-9zbMath1360.90260OpenAlexW1024415283MaRDI QIDQ5963630
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9746-9
\((s,t)\)-relaxed \(L(2,1)\)-labeling\(L(2,1)\)-labeling\(t\)-star matchingbreaking path coveringpath covering
Related Items
Facial \(L(2, 1)\)-edge-labelings of trees ⋮ Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem ⋮ Frequency assignment problem in networks with limited spectrum ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ On (s,t)-relaxed L(1,1)-labelling of trees
Cites Work
- Unnamed Item
- Unnamed Item
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- Star matching and distance two labelling
- Relating path coverings to vertex labellings with a condition at distance two
- Weighted improper colouring
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- A survey on labeling graphs with a condition at distance two
- Griggs and Yeh's Conjecture and $L(p,1)$-labelings
- On Moore Graphs with Diameters 2 and 3
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- Labelling Graphs with a Condition at Distance 2
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Hamiltonicity and circular distance two labellings
- Fixed-parameter complexity of \(\lambda\)-labelings
This page was built for publication: On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
