Hamiltonicity and circular distance two labellings
From MaRDI portal
Publication:5937459
DOI10.1016/S0012-365X(00)00299-5zbMath0977.05078MaRDI QIDQ5937459
Publication date: 8 January 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (22)
Distance-two labelings of digraphs ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ Group path covering and \(L(j,k)\)-labelings of diameter two graphs ⋮ Group path covering and distance two labeling of graphs ⋮ Distance two edge labelings of lattices ⋮ Circular \(L(j,k)\)-labeling number of direct product of path and cycle ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Radio number for trees ⋮ \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs ⋮ \(L(2,1)\)-labelings of Cartesian products of two cycles ⋮ On critical trees labeled with a condition at distance two ⋮ Multiple \(L(j,1)\)-labeling of the triangular lattice ⋮ 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 ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs ⋮ \(L(j,k)\)-labeling number of Cartesian product of path and cycle ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ Linear and cyclic distance-three labellings of trees ⋮ Distance-two labellings of Hamming graphs ⋮ On \(L(2,1)\)-labelings of Cartesian products of paths and cycles ⋮ On circular-L(2, 1)-labellings of products of graphs ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
This page was built for publication: Hamiltonicity and circular distance two labellings
