scientific article; zbMATH DE number 1439442
From MaRDI portal
Publication:4949819
zbMath0960.05093MaRDI QIDQ4949819
John P. Georges, David W. Mauro
Publication date: 17 May 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Orthogonal arrays, Latin squares, Room squares (05B15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (22)
\(L(j, k)\)-number of direct product of path and cycle ⋮ 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 ⋮ Distance two labelling and direct products of graphs ⋮ Labelling of some planar graphs with a condition at distance two ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs ⋮ Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers ⋮ A bound on the chromatic number of the square of a planar graph ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles ⋮ \(L(2,1)\)-labelings of Cartesian products of two cycles ⋮ A survey on labeling graphs with a condition at distance two ⋮ Labeling trees with a condition at distance two ⋮ A distance-labelling problem for hypercubes ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ Labeling trees with a condition at distance two ⋮ \(L(h,k)\)-labelings of Hamming graphs ⋮ Distance-two labellings of Hamming graphs ⋮ On \(L(2,1)\)-labelings of Cartesian products of paths and cycles ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey ⋮ Radio number for the product of a path and a complete graph ⋮ Distance-two labelings of graphs
This page was built for publication:
