scientific article
From MaRDI portal
Publication:3838194
zbMath0904.05077MaRDI QIDQ3838194
John P. Georges, David W. Mauro
Publication date: 9 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (64)
L(3,1)-labeling of circulant graphs ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ Distance-two labelings of digraphs ⋮ \(L(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ \(L(2,1)\)-labelings on the modular product of two graphs ⋮ \(L(p,2,1)\)-labeling of the infinite regular trees ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ The \((p,q)\)-total labeling problem for trees ⋮ L(2,1,1)-labeling of interval graphs ⋮ Group path covering and \(L(j,k)\)-labelings of diameter two graphs ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ Group path covering and distance two labeling of graphs ⋮ Special structures in \(\mathcal{Q}(4, q)\), projective planes and its application in \(L(h, k)\)-colorings of their Moore graphs ⋮ Greedy \(F\)-colorings of graphs ⋮ \((p,q)\)-total labeling of complete graphs ⋮ \(L(2,1)\)-labelings of some families of oriented planar graphs ⋮ Unnamed Item ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ The \(L(2,1)\)-labeling on the skew and converse skew products of graphs ⋮ On a distance-constrained graph labeling to model cooperation ⋮ 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 Cartesian sum of graphs ⋮ The \(L(2,1)\)-labeling on graphs and the frequency assignment problem ⋮ Channel assignment on Cayley graphs ⋮ Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks ⋮ Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers ⋮ New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ Graph labellings with variable weights, a survey ⋮ Labeling the \(r\)-path with a condition at distance two ⋮ \(L(j,k)\)-labelling and maximum ordering-degrees for trees ⋮ A bound on the chromatic number of the square of a planar graph ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs ⋮ Unnamed Item ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ \(L(2,1)\)-labelings of Cartesian products of two cycles ⋮ On critical trees labeled with a condition at distance two ⋮ On real number labelings and graph invertibility ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ L(1,1)-Labeling of direct product of cycles ⋮ Labeling graphs with two distance constraints ⋮ \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph ⋮ Lambda number of the power graph of a finite group ⋮ \(L(1, 2)\)-edge-labelings for lattices ⋮ Labeling trees with a condition at distance two ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ Distance two surjective labelling of paths and interval graphs ⋮ Linear and cyclic distance-three labellings of trees ⋮ Labeling trees with a condition at distance two ⋮ \(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 ⋮ The \(L(d,1)\)-number of powers of paths ⋮ \(L(p,q)\)-labeling of digraphs ⋮ Distance-two labellings of Hamming graphs ⋮ On \(L(2,1)\)-labelings of Cartesian products of paths and cycles ⋮ Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles ⋮ \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs ⋮ Distance-two labelings of graphs ⋮ List version of \(L(d,s)\)-labelings
This page was built for publication:
