The L(2,1)-Labeling Problem on Graphs
From MaRDI portal
Publication:4881295
Recommendations
Cited in
(only showing first 100 items - show all)- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- An extremal problem on non-full colorable graphs
- Linear and cyclic distance-three labellings of trees
- Labeling graphs with two distance constraints
- A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\)
- Distance-two labellings of Hamming graphs
- On the \(L(2, 1)\)-labelling of block graphs
- Frequency assignment problem in networks with limited spectrum
- On critical trees labeled with a condition at distance two
- On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- Some open problems on graph labelings
- Distance-two labelings of digraphs
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
- \(L(2, 1)\)-labeling of circulant graphs
- List version of \(L(d,s)\)-labelings
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- The path-partition problem in block graphs
- The \(L(d_1,d_2)\)-labeling problem on graphs
- Labeling trees with a condition at distance two
- A complete \(L (2, 1)\) span characterization for small trees
- Injective colorings with arithmetic constraints
- Labelling planar graphs without 4-cycles with a condition on distance two
- \(k\)-path partitions in trees
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- \(\lambda\)-coloring matrogenic graphs
- Distance Constrained Labelings of Trees
- \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs
- A note on collections of graphs with non-surjective lambda labelings
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
- Equitable colorings of bounded treewidth graphs
- Distance constrained labelings of planar graphs with no short cycles
- scientific article; zbMATH DE number 2016729 (Why is no real title available?)
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
- Distance-two labelings of graphs
- \(L(h,k)\)-labelings of Hamming graphs
- On the number of 2-packings in a connected graph
- scientific article; zbMATH DE number 7478538 (Why is no real title available?)
- Distance two labelling and direct products of graphs
- Algorithms for graphs with small octopus
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- On a labeling problem in graphs
- \(L(3,1)\)-labeling of circulant graphs
- On the \(k\)-path partition of graphs.
- \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
- A lower bound technique for radio \(k\)-coloring
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Hamiltonian path saturated graphs with small size
- On the \(k\)-path cover problem for cacti
- A linear time algorithm for \(L(2,1)\)-labeling of trees
- Extremal problems on consecutive \(L(2,1)\)-labelling
- A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\)
- \((2,1)\)-total labeling of trees with large maximum degree
- \(L(2,1)\)-labeling of direct product of paths and cycles
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- Radio number for trees
- A survey on labeling graphs with a condition at distance two
- \(L(2,1)\)-labelings of subdivisions of graphs
- Injective coloring of planar graphs
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- \(L(2,1)\)-labeling of interval graphs
- \(L(p,2,1)\)-labeling of the infinite regular trees
- Randomly colouring graphs (a combinatorial view)
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- On the L(h,k)-Labeling of Co-comparability Graphs
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
- On \(L(d,1)\)-labelings of graphs
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- A bound on the chromatic number of the square of a planar graph
- Graph labellings with variable weights, a survey
- \(L(p,q)\) labeling of \(d\)-dimensional grids
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Labeling planar graphs with a condition at distance two
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- Labelings of Graphs with Fixed and Variable Edge-Weights
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
- The \(L(2,1)\)-labeling of unigraphs
- The 2-dipath chromatic number of Halin graphs
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees
- Algorithms for solving problems on graphs of bounded pathwidth
- A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)
- Fixed-parameter complexity of \(\lambda\)-labelings
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- Group path covering and distance two labeling of graphs
- Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- Complexity of (p,1)-total labelling
- Optimal radio labellings of complete \(m\)-ary trees
- \(L(h,1,1)\)-labeling of outerplanar graphs
- The \((p,q)\)-total labeling problem for trees
- \( L ( p , q )\)-labelings of subdivisions of graphs
- The \(L(h,1,1)\)-labelling problem for trees
- \((2,1)\)-Total number of trees with maximum degree three
- On the \(L(p,1)\)-labelling of graphs
This page was built for publication: The $L(2,1)$-Labeling Problem on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4881295)
