The $L(2,1)$-Labeling Problem on Graphs
From MaRDI portal
Publication:4881295
DOI10.1137/S0895480193245339zbMath0860.05064MaRDI QIDQ4881295
No author found.
Publication date: 21 April 1997
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On theL(2, 1)-labelling of block graphs, Injective coloring of planar graphs, Fixed-parameter complexity of \(\lambda\)-labelings, Labeling trees with a condition at distance two, Labeling trees with a condition at distance two, New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs, Parameterized complexity of coloring problems: treewidth versus vertex cover, The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs, On critical trees labeled with a condition at distance two, \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\), Exact algorithms for \(L(2,1)\)-labeling of graphs, \(L(2,1)\)-labeling of perfect elimination bipartite graphs, On distance constrained labeling of disk graphs, Equitable colorings of bounded treewidth graphs, List version of \(L(d,s)\)-labelings, An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees, \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs, The 2-dipath chromatic number of Halin graphs, \(\lambda\)-coloring matrogenic graphs, The \(L(2,1)\)-labeling on planar graphs, Distance-two labelings of digraphs, Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs, Distance two labelling and direct products of graphs, Labelling planar graphs without 4-cycles with a condition on distance two, The \(L(2,1)\)-labeling on Cartesian sum of graphs, Distance constrained labelings of planar graphs with no short cycles, Graph labellings with variable weights, a survey, Complexity of (p,1)-total labelling, Optimal radio labellings of complete \(m\)-ary trees, \(L(j,k)\)-labelling and maximum ordering-degrees for trees, (2,1)-total labelling of trees with sparse vertices of maximum degree, The \(L(h,1,1)\)-labelling problem for trees, \(L(2,1)\)-labelings on the composition of \(n\) graphs, \((2,1)\)-Total number of trees with maximum degree three, Labeling graphs with two distance constraints, The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications, On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path, \(L(h,k)\)-labelings of Hamming graphs, A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes, The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree, Labeling bipartite permutation graphs with a condition at distance two, Distance-two labellings of Hamming graphs, Some results on distance two labelling of outerplanar graphs, \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings, Distance constrained labelings of \(K_{4}\)-minor free graphs, Partial and perfect path covers of cographs, The path-partition problem in block graphs, \(k\)-path partitions in trees, On the \(k\)-path partition of graphs., Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers, No-hole \(L(2,1)\)-colorings, Algorithms for graphs with small octopus, Systems of distant representatives, \(L(2,1)\)-labeling of direct product of paths and cycles, A note on collections of graphs with non-surjective lambda labelings, Path partition for graphs with special blocks, Theory of computational complexity. Part 7. Transl. from the Russian, On \(L(2,1)\)-labelings of Cartesian products of paths and cycles, Distance-two labelings of graphs, The \(L(2,1)\)-labeling of unigraphs, On the \(k\)-path cover problem for cacti, Extremal problems on consecutive \(L(2,1)\)-labelling, \(L(p,q)\) labeling of \(d\)-dimensional grids, An extremal problem on non-full colorable graphs, Labeling planar graphs with a condition at distance two, \((2,1)\)-total labelling of outerplanar graphs, The \(L(2,1)\)-labeling on the skew and converse skew products of graphs, Radio number for trees, Recent progress in mathematics and engineering on optimal graph labellings with distance conditions, \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs, The \(L(2,1)\)-labeling on graphs and the frequency assignment problem, On the \(L(p,1)\)-labelling of graphs, A bound on the chromatic number of the square of a planar graph, The \(L(2,1)\)-labelling of trees, Hamiltonian path saturated graphs with small size, \(L(2,1)\)-labelings of Cartesian products of two cycles, A survey on labeling graphs with a condition at distance two, Systems of pairs of \(q\)-distant representatives, and graph colorings, Fast Exact Algorithm for L(2,1)-Labeling of Graphs, Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs, Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs, Distance Constrained Labelings of Trees, An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
