Publication:4242956
From MaRDI portal
DOI<263::AID-JGT5>3.0.CO;2-V 10.1002/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-VzbMath0930.05087MaRDI QIDQ4242956
Jan van den Heuvel, R. A. Leese, M. A. Shepherd
Publication date: 9 February 2000
Related Items
Unnamed Item, On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs, Polyhedral studies for minimum‐span graph labelling with integer distance constraints, Fixed-parameter complexity of \(\lambda\)-labelings, Labeling trees with a condition at distance two, On distance constrained labeling of disk graphs, No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups, Distance-two labelings of digraphs, A distance-labelling problem for hypercubes, On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path, On Hamiltonian colorings for some graphs, Labeling bipartite permutation graphs with a condition at distance two, Distance-two labellings of Hamming graphs, Combinatorial optimization in system configuration design, \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings, A doubly cyclic channel assignment problem, Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers, 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, On Hamiltonian colorings of graphs, Generalized list \(T\)-colorings of cycles, On \(L(2,1)\)-labelings of Cartesian products of paths and cycles, Worst-case analysis of a dynamic channel assignment strategy, Distance-two labelings of graphs, Distributive online channel assignment for hexagonal cellular networks with constraints, Arrangements, channel assignments, and associated polynomials, Extremal problems on consecutive \(L(2,1)\)-labelling, An extremal problem on non-full colorable 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, On the computational complexity of partial covers of theta graphs, A bound on the chromatic number of the square of a planar graph, A survey on labeling graphs with a condition at distance two, Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
