Publication:4940064
From MaRDI portal
zbMath0933.05139MaRDI QIDQ4940064
Daphne Der-Fen Liu, Roger K.-C. Yeh
Publication date: 1 March 2000
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Fixed-parameter complexity of \(\lambda\)-labelings, Labeling trees with a condition at distance two, Labeling trees with a condition at distance two, Radio mean labeling of a graph, \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs, The \(L(2,1)\)-labeling on planar graphs, Distance-two labelings of digraphs, The \(L(2,1)\)-labeling on Cartesian sum of graphs, \(L(j,k)\)-labelling and maximum ordering-degrees for trees, 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, Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers, No-hole \(L(2,1)\)-colorings, Systems of distant representatives, \(L(2,1)\)-labeling of direct product of paths and cycles, Generalized list \(T\)-colorings of cycles, 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 on the skew and converse skew products of graphs, The \(L(2,1)\)-labeling on graphs and the frequency assignment problem, \(L(2,1)\)-labelings of Cartesian products of two cycles, A survey on labeling graphs with a condition at distance two, Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles, Systems of pairs of \(q\)-distant representatives, and graph colorings
